perm filename E84.IN[LET,JMC] blob
sn#771046 filedate 1984-09-30 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00512 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00050 00002 ∂03-Jul-84 1139 HST visit
C00057 00003 ∂03-Jul-84 1327 ME Prancing Pony Bill
C00059 00004 ∂03-Jul-84 1636 @SU-SCORE.ARPA:NILSSON@SRI-AI.ARPA New Circum Paper
C00061 00005 ∂03-Jul-84 1848 AAAI-OFFICE@SUMEX-AIM.ARPA agenda
C00062 00006 ∂04-Jul-84 1217 RPG Visit
C00063 00007 ∂04-Jul-84 1244 KAHN@USC-ISI.ARPA Re: Visit
C00064 00008 ∂04-Jul-84 1400 JMC*
C00065 00009 ∂04-Jul-84 1549 HST plander
C00067 00010 ∂04-Jul-84 1622 JMC
C00068 00011 ∂04-Jul-84 2100 JMC*
C00069 00012 ∂04-Jul-84 2100 JMC*
C00070 00013 ∂04-Jul-84 2101 CLT protection
C00071 00014 ∂05-Jul-84 0604 ATP.BLEDSOE@UTEXAS-20.ARPA Re: agenda
C00072 00015 ∂05-Jul-84 0851 graham%ucbernie@Berkeley Re: Paper you sent to Cartwright for refereeing.
C00073 00016 ∂05-Jul-84 0900 JMC*
C00074 00017 ∂05-Jul-84 0904 HART@SRI-AI.ARPA Re: Post-Doctorate program
C00081 00018 ∂05-Jul-84 1000 JMC*
C00082 00019 ∂05-Jul-84 1047 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI Executive Council Meeting
C00085 00020 ∂05-Jul-84 1545 BSCOTT@SU-SCORE.ARPA Two Items
C00087 00021 ∂05-Jul-84 1603 BSCOTT@SU-SCORE.ARPA Lifschitz
C00088 00022 ∂05-Jul-84 1700 BSCOTT@SU-SCORE.ARPA Applicant
C00089 00023 ∂05-Jul-84 1748 burton@Navajo Re: Visit
C00090 00024 ∂06-Jul-84 0803 BSCOTT@SU-SCORE.ARPA
C00091 00025 ∂06-Jul-84 0900 JMC*
C00092 00026 ∂06-Jul-84 1008 DFH
C00093 00027 ∂06-Jul-84 1115 NITZAN@SRI-AI.ARPA Re: Ivan Plander
C00095 00028 ∂06-Jul-84 1124 DFH
C00096 00029 ∂06-Jul-84 1154 DFH
C00097 00030 ∂06-Jul-84 1225 HST greetings from mike levin
C00098 00031 ∂06-Jul-84 1400 JMC*
C00099 00032 ∂06-Jul-84 1448 KAHN@USC-ISI.ARPA Re: Visit
C00100 00033 ∂06-Jul-84 1449 KAHN@USC-ISI.ARPA Re: visit
C00101 00034 ∂06-Jul-84 1451 burton@Navajo Re: Visit
C00102 00035 ∂06-Jul-84 1558 RPG Re: Visit
C00104 00036 ∂07-Jul-84 1234 WALKER@SRI-AI.ARPA Re: Post-Doctorate program
C00106 00037 ∂08-Jul-84 0039 Mclure@sri-unix human vs. machine chess game for your perusal
C00108 00038 ∂08-Jul-84 1233 @MIT-MC:MINSKY@MIT-OZ Very High Performance Computing
C00111 00039 ∂08-Jul-84 1646 CLT
C00112 00040 ∂09-Jul-84 0021 CLT please
C00113 00041 ∂09-Jul-84 0100 JMC*
C00114 00042 ∂09-Jul-84 0102 CLT chapter 1
C00115 00043 ∂09-Jul-84 0500 OHLANDER@USC-ISI.ARPA Re: accomplishments
C00116 00044 ∂09-Jul-84 0927 BSCOTT@SU-SCORE.ARPA Secretary
C00117 00045 ∂09-Jul-84 1037 HOBBS@SRI-AI.ARPA General Meeting of Commonsense Summer
C00118 00046 ∂09-Jul-84 1055 DFH
C00119 00047 ∂09-Jul-84 1100 JMC*
C00120 00048 ∂09-Jul-84 1122 wilensky%ucbdali@Berkeley.arpa Re: Very High Performance Computing
C00123 00049 ∂09-Jul-84 1325 ME news wires
C00124 00050 ∂09-Jul-84 1424 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 13, 1984.
C00128 00051 ∂09-Jul-84 1732 MADSEN@SU-CSLI.ARPA Interview
C00130 00052 ∂09-Jul-84 2130 minker@umcp-cs.arpa Math Year Schedule
C00132 00053 ∂09-Jul-84 2223 TREITEL@SUMEX-AIM.ARPA re: : Nuclear lunch 7/10 - food for thought (from SAIL's BBOARD)
C00134 00054 ∂10-Jul-84 1054 IAM
C00135 00055 ∂10-Jul-84 1124 IAM
C00136 00056 ∂10-Jul-84 1304 DFH
C00137 00057 ∂10-Jul-84 1832 CLT meetings
C00138 00058 ∂11-Jul-84 0017 ARK I've never heard of such a rule...who told him?
C00140 00059 ∂11-Jul-84 0019 ARK Previous message
C00141 00060 ∂11-Jul-84 0028 ARK Rereading
C00142 00061 ∂11-Jul-84 0031 ARK orals
C00143 00062 ∂11-Jul-84 0049 cheriton@Navajo Re: why people flee
C00144 00063 ∂11-Jul-84 0906 AAAI-OFFICE@SUMEX-AIM.ARPA [Bonnie Webber <Bonnie%upenn.csnet@csnet-relay.arpa>: AAAI Executive Council Meeting]
C00147 00064 ∂11-Jul-84 1042 DFH
C00148 00065 ∂11-Jul-84 1100 CLT old latex
C00149 00066 ∂11-Jul-84 1147 AAAI-OFFICE@SUMEX-AIM.ARPA election results
C00152 00067 ∂11-Jul-84 1330 DFH
C00153 00068 ∂11-Jul-84 1357 DFH
C00154 00069 ∂11-Jul-84 1841 RPG
C00155 00070 ∂11-Jul-84 2019 AAAI-OFFICE@SUMEX-AIM.ARPA draft agenda
C00158 00071 ∂11-Jul-84 2040 RPG Penumvirate
C00159 00072 ∂11-Jul-84 2115 RPG
C00160 00073 ∂12-Jul-84 0606 BARWISE@SU-CSLI.ARPA
C00161 00074 ∂12-Jul-84 0925 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 13, 1984
C00162 00075 ∂12-Jul-84 1453 BSCOTT@SU-SCORE.ARPA Applicant
C00163 00076 ∂12-Jul-84 1602 BSCOTT@SU-SCORE.ARPA
C00164 00077 ∂12-Jul-84 1643 Mailer failed mail returned
C00165 00078 ∂12-Jul-84 1648 LERMAN@SRI-KL.ARPA AAAI publications committee meeting
C00169 00079 ∂13-Jul-84 0801 HST lisp history
C00172 00080 ∂13-Jul-84 0926 GROSOF@SU-SCORE.ARPA Re: bibliography
C00173 00081 ∂13-Jul-84 0932 DEK chapiro's committee
C00175 00082 ∂13-Jul-84 1047 HST kemeny
C00179 00083 ∂13-Jul-84 1424 HEDRICK@RUTGERS.ARPA Re: Your Common Lisp
C00181 00084 ∂13-Jul-84 1704 BSCOTT@SU-SCORE.ARPA Beth Moore
C00182 00085 ∂14-Jul-84 1247 IAM
C00183 00086 ∂14-Jul-84 1342 BSCOTT@SU-SCORE.ARPA
C00184 00087 ∂14-Jul-84 1628 IAM
C00186 00088 ∂15-Jul-84 1412 WIEDERHOLD@SRI-AI.ARPA sail chars.
C00197 00089 ∂15-Jul-84 1529 GROSOF@SU-SCORE.ARPA default reasoning as circumscription
C00198 00090 ∂15-Jul-84 1738 GROSOF@SU-SCORE.ARPA
C00200 00091 ∂16-Jul-84 0851 BERG@SU-SCORE.ARPA textbooks
C00202 00092 ∂16-Jul-84 0929 DFH
C00203 00093 ∂16-Jul-84 0931 vardi@diablo re: "The Fifth Generation" (from SAIL's BBOARD)
C00204 00094 ∂16-Jul-84 0953 AAAI-OFFICE@SUMEX-AIM.ARPA SCRIPT
C00209 00095 ∂16-Jul-84 1122 DFH
C00210 00096 ∂16-Jul-84 1150 BERG@SU-SCORE.ARPA text (again)
C00211 00097 ∂16-Jul-84 1414 HOBBS@SRI-AI.ARPA General meeting this week
C00213 00098 ∂17-Jul-84 0710 HST a permission
C00214 00099 ∂17-Jul-84 0909 HART@SRI-AI.ARPA AAAI Exec. Comm. Agenda
C00220 00100 ∂17-Jul-84 1434 DFH
C00221 00101 ∂17-Jul-84 1436 JK 3600 EKL
C00222 00102 ∂17-Jul-84 1520 JK
C00223 00103 ∂17-Jul-84 1556 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 20, l984
C00226 00104 ∂17-Jul-84 1751 BSCOTT@SU-SCORE.ARPA Rutie Adler
C00227 00105 ∂17-Jul-84 1805 BSCOTT@SU-SCORE.ARPA Re: Adler
C00229 00106 ∂17-Jul-84 2301 vardi@diablo Mailing List
C00231 00107 ∂18-Jul-84 0838 HART@SRI-AI.ARPA Re: aaai exec-com agenda
C00234 00108 ∂18-Jul-84 0900 JMC*
C00235 00109 ∂18-Jul-84 0941 DFH
C00236 00110 ∂18-Jul-84 0952 DFH
C00237 00111 ∂18-Jul-84 0953 vardi@diablo Conference
C00238 00112 ∂18-Jul-84 0925 HOBBS@SRI-AI.ARPA Meeting Reminder
C00239 00113 ∂18-Jul-84 0934 SPURGEON@SU-CSLI.ARPA re: nuclear targeting (from SAIL's BBOARD)
C00241 00114 ∂18-Jul-84 0959 DFH
C00242 00115 ∂18-Jul-84 1047 TREITEL@SUMEX-AIM.ARPA re: nuclear targeting (from SAIL's BBOARD)
C00244 00116 ∂18-Jul-84 1116 DFH
C00245 00117 ∂18-Jul-84 1132 BSCOTT@SU-SCORE.ARPA Rutie Adler
C00246 00118 ∂18-Jul-84 1254 IAM
C00247 00119 ∂18-Jul-84 1949 RWW SATO
C00249 00120 ∂19-Jul-84 0606 ATP.BLEDSOE@UTEXAS-20.ARPA Re: aaai exec-com agenda
C00251 00121 ∂19-Jul-84 0703 HST lisp history etc.
C00252 00122 ∂19-Jul-84 0844 HST visit
C00253 00123 ∂19-Jul-84 1517 DFH
C00254 00124 ∂19-Jul-84 1518 HST visit
C00255 00125 ∂19-Jul-84 1610 GLB
C00258 00126 ∂20-Jul-84 0706 @COLUMBIA-20.ARPA:US.TRAVIS@CU20B Re: SMP
C00259 00127 ∂20-Jul-84 0831 AAAI-OFFICE@SUMEX-AIM.ARPA parking permit
C00260 00128 ∂20-Jul-84 0915 minker@umcp-cs.arpa Math Year Schedule
C00266 00129 ∂20-Jul-84 0927 @COLUMBIA-20.ARPA:US.TRAVIS@CU20B Re: smp
C00267 00130 ∂20-Jul-84 1205 ZM
C00268 00131 ∂20-Jul-84 1240 PACK@SU-SCORE.ARPA Dynamic logic
C00270 00132 ∂20-Jul-84 1326 BSCOTT@SU-SCORE.ARPA Rutie Adler
C00271 00133 ∂20-Jul-84 1401 CLT
C00272 00134 ∂20-Jul-84 1457 BSCOTT@SU-SCORE.ARPA
C00273 00135 ∂20-Jul-84 1753 HOBBS@SRI-AI.ARPA Target Problems
C00277 00136 ∂20-Jul-84 2111 PACK@SU-SCORE.ARPA
C00278 00137 ∂21-Jul-84 0842 JM01@CMU-CS-A.ARPA item for executive committee agenda
C00280 00138 ∂21-Jul-84 1043 JM01@CMU-CS-A.ARPA
C00282 00139 ∂21-Jul-84 1356 PACK@SU-SCORE.ARPA
C00284 00140 ∂22-Jul-84 0948 RPG Tomorrow
C00285 00141 ∂22-Jul-84 0958 RPG
C00286 00142 ∂23-Jul-84 0900 JMC*
C00287 00143 ∂23-Jul-84 0900 JMC*
C00288 00144 ∂23-Jul-84 1003 TOB sending greetings
C00289 00145 ∂23-Jul-84 1309 SIMONDS@CMU-CS-C.ARPA
C00292 00146 ∂23-Jul-84 1341 BSCOTT@SU-SCORE.ARPA Secretary
C00293 00147 ∂23-Jul-84 1828 AAAI-OFFICE@SUMEX-AIM.ARPA parking permit
C00295 00148 ∂23-Jul-84 2218 Brachman@SRI-KL.ARPA Reminder about AAAI-84
C00297 00149 ∂24-Jul-84 1000 HOBBS@SRI-AI.ARPA Commonsense Summer Meeting
C00298 00150 ∂24-Jul-84 1048 DFH
C00299 00151 ∂24-Jul-84 1127 DFH
C00300 00152 ∂24-Jul-84 1154 JAMIE@SU-CSLI.ARPA new secretary
C00303 00153 ∂24-Jul-84 1239 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, July 27, l984
C00307 00154 ∂25-Jul-84 1031 HOBBS@SRI-AI.ARPA Meeting Reminder
C00308 00155 ∂25-Jul-84 1110 DOYLE@CMU-CS-C.ARPA AI Magazine policy needed
C00312 00156 ∂25-Jul-84 1340 BUCHANAN@SUMEX-AIM.ARPA AAAI Exec Comm. mtg
C00313 00157 ∂26-Jul-84 0604 ATP.BLEDSOE@UTEXAS-20.ARPA Re: AI Magazine policy needed
C00315 00158 ∂26-Jul-84 1612 ME authorizing accounts
C00316 00159 ∂26-Jul-84 1617 BSCOTT@SU-SCORE.ARPA Rebecca Johns
C00317 00160 ∂26-Jul-84 1803 HST visit
C00318 00161 ∂26-Jul-84 1940 YAW your social writings
C00319 00162 ∂27-Jul-84 1333 AAAI-OFFICE@SUMEX-AIM.ARPA Execcom Agenda
C00323 00163 ∂27-Jul-84 1414 IAM
C00324 00164 ∂28-Jul-84 1100 JMC*
C00325 00165 ∂28-Jul-84 1100 JMC*
C00326 00166 ∂28-Jul-84 1227 ENGELMORE@SUMEX-AIM.ARPA Re: AI Magazine policy needed
C00330 00167 ∂29-Jul-84 1136 HST ai-memos
C00332 00168 ∂29-Jul-84 2049 HST tex78
C00333 00169 ∂29-Jul-84 2122 @MIT-MC:MINSKY@MIT-OZ mail
C00335 00170 ∂30-Jul-84 1010 GOLUB@SU-SCORE.ARPA [PRG5%vax2.ox@ucl-cs.arpa:]
C00338 00171 ∂30-Jul-84 1036 WIEDERHOLD@SUMEX-AIM.ARPA Re: bboard reading
C00340 00172 ∂30-Jul-84 1235 SHORTLIFFE@SUMEX-AIM.ARPA Council meeting
C00342 00173 ∂30-Jul-84 1406 HOBBS@SRI-AI.ARPA Dry Run
C00345 00174 ∂30-Jul-84 1538 CHURD@SU-SCORE.ARPA LUNCHEON
C00347 00175 ∂30-Jul-84 1538 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, August 3, l984
C00349 00176 ∂30-Jul-84 1550 BSCOTT@SU-SCORE.ARPA Rutie Adler
C00350 00177 ∂30-Jul-84 2239 JK
C00352 00178 ∂31-Jul-84 0311 PRG5%Vax2.ox.AC.UK%44d.Ucl-Cs.AC.UK@Ucl-Cs.ARPA
C00353 00179 ∂31-Jul-84 0652 SIMONDS@CMU-CS-C.ARPA Re: bank account
C00355 00180 ∂31-Jul-84 0900 JMC*
C00356 00181 ∂31-Jul-84 0910 BSCOTT@SU-SCORE.ARPA Rutie Adler
C00357 00182 ∂31-Jul-84 1021 @USC-ECL.ARPA:FIKES@ECLD Chairing the Prize Paper Session
C00365 00183 ∂31-Jul-84 1036 HOBBS@SRI-AI.ARPA Weekly Meeting
C00367 00184 ∂31-Jul-84 1045 AAAI-OFFICE@SUMEX-AIM.ARPA 35mm Slide Requirements
C00368 00185 ∂31-Jul-84 1047 HOBBS@SRI-AI.ARPA Re: the dry runs
C00370 00186 ∂31-Jul-84 1246 jbn@FORD-WDL1.ARPA Re: Bulletin board organization
C00373 00187 ∂31-Jul-84 1356 BSCOTT@SU-SCORE.ARPA Sarah
C00374 00188 ∂31-Jul-84 1403 ELYSE@SU-SCORE.ARPA Sjodin file
C00375 00189 ∂31-Jul-84 1417 BSCOTT@SU-SCORE.ARPA Re: Sarah
C00376 00190 ∂31-Jul-84 1434 SJG
C00378 00191 ∂31-Jul-84 1440 SJG slide maker
C00379 00192 ∂31-Jul-84 1600 JMC*
C00380 00193 ∂01-Aug-84 0000 JMC*
C00381 00194 ∂01-Aug-84 0040 Brachman@SRI-KL.ARPA Re: 35mm Slide Requirements
C00383 00195 ∂01-Aug-84 0935 HOBBS@SRI-AI.ARPA Meeting Reminder
C00384 00196 ∂01-Aug-84 0941 CSL.ALLISON@SU-SIERRA.ARPA Can you schedule an interview appointment?
C00386 00197 ∂01-Aug-84 1435 ullman@diablo McCarthy/Talcott book
C00387 00198 ∂01-Aug-84 1952 DFH time meeting
C00388 00199 ∂02-Aug-84 1213 DFH Time Mag.
C00389 00200 ∂02-Aug-84 1240 DFH P. Sprague
C00390 00201 ∂02-Aug-84 1702 JOHN@SU-CSLI.ARPA kuo
C00392 00202 ∂02-Aug-84 1705 JOHN@SU-CSLI.ARPA kuo
C00395 00203 ∂03-Aug-84 0410 ARK Prancing Pony Bill
C00397 00204 ∂03-Aug-84 1100 JMC*
C00398 00205 ∂04-Aug-84 1403 JOHN@SU-CSLI.ARPA Re: Kuo
C00399 00206 ∂05-Aug-84 0813 GHG Help
C00400 00207 ∂05-Aug-84 1705 ME news blackout last week
C00401 00208 ∂06-Aug-84 0845 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT!!!
C00402 00209 ∂07-Aug-84 1208 minker@maryland.arpa ABSTRACT and Social SEC. No.
C00406 00210 ∂08-Aug-84 1713 DFH
C00407 00211 ∂08-Aug-84 1825 GOLUB@SU-SCORE.ARPA lunch
C00408 00212 ∂09-Aug-84 0717 CL.BOYER@UTEXAS-20.ARPA Next Lisp Conference
C00409 00213 ∂09-Aug-84 0843 jim@SCRC-STONY-BROOK.ARPA new NUSUM, etc.
C00412 00214 ∂09-Aug-84 1101 DFH
C00413 00215 ∂09-Aug-84 1210 DFH
C00414 00216 ∂10-Aug-84 1343 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK new NUSUM, etc.
C00424 00217 ∂10-Aug-84 2048 CHURD@SU-SCORE.ARPA LUNCH, AUGUST 11.
C00427 00218 ∂13-Aug-84 0605 ATP.BLEDSOE@UTEXAS-20.ARPA Re: promoting basic research in AI
C00430 00219 ∂13-Aug-84 0840 DOYLE@CMU-CS-C.ARPA Re: non-monotonic
C00432 00220 ∂13-Aug-84 0841 DOYLE@CMU-CS-C.ARPA Re: non-monotonic
C00433 00221 ∂13-Aug-84 0900 JMC*
C00434 00222 ∂13-Aug-84 0900 JMC*
C00435 00223 ∂13-Aug-84 1004 DFH
C00436 00224 ∂13-Aug-84 1505 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - THURSDAY, August 16, l984
C00438 00225 ∂13-Aug-84 1609 HOBBS@SRI-AI.ARPA Meeting Thursday instead of Tuesday
C00440 00226 ∂13-Aug-84 1714 DFH Veronica Dahl's visit
C00442 00227 ∂13-Aug-84 2031 LLW@S1-A.ARPA Home Stretch
C00444 00228 ∂14-Aug-84 0613 ATP.BLEDSOE@UTEXAS-20.ARPA A paper of yours
C00445 00229 ∂14-Aug-84 0811 BSCOTT@SU-SCORE.ARPA Re: Veronica Dahl honorarium
C00446 00230 ∂14-Aug-84 0930 DFH
C00447 00231 ∂14-Aug-84 0932 DFH V.Dahl
C00448 00232 ∂14-Aug-84 1119 GEORGEFF@SRI-AI.ARPA Transport to workshop
C00450 00233 ∂14-Aug-84 1346 ASHOK@SU-SCORE.ARPA About this project ...
C00452 00234 ∂14-Aug-84 1501 MRC@SU-SCORE.ARPA other OS's
C00454 00235 ∂14-Aug-84 1509 VAL
C00455 00236 ∂14-Aug-84 1950 ASHOK@SU-SCORE.ARPA Re: editor based operating system
C00457 00237 ∂14-Aug-84 2227 DT50@CMU-CS-A.ARPA Re: Gentle introduction
C00458 00238 ∂15-Aug-84 0900 JMC*
C00459 00239 ∂15-Aug-84 0900 JMC*
C00460 00240 ∂15-Aug-84 1002 HANSON@SRI-AI.ARPA An operating system better than Unix...
C00462 00241 ∂15-Aug-84 1036 CLT jmctst
C00463 00242 ∂15-Aug-84 1051 SAMUEL@SU-SCORE.ARPA Re: S1 & NCC
C00464 00243 ∂15-Aug-84 1053 KASHTAN@SRI-AI.ARPA re: S1 & NCC
C00465 00244 ∂15-Aug-84 1120 DFH C. Hurd
C00466 00245 ∂15-Aug-84 1158 FEIGENBAUM@SUMEX-AIM.ARPA need to talk
C00468 00246 ∂15-Aug-84 1515 GLB
C00469 00247 ∂15-Aug-84 1717 CL.BOYER@UTEXAS-20.ARPA Re: S1 & NCC
C00471 00248 ∂15-Aug-84 2143 RPG
C00472 00249 ∂16-Aug-84 0126 ARK Do you have the answer to this...thanks.
C00474 00250 ∂16-Aug-84 0235 LLW@S1-A.ARPA Advice By Phone?
C00476 00251 ∂16-Aug-84 0843 DFH Sarah's mail.
C00477 00252 ∂16-Aug-84 0850 AAAI-OFFICE@SUMEX-AIM.ARPA Re: another goof
C00478 00253 ∂16-Aug-84 0933 HOBBS@SRI-AI.ARPA Meeting Reminder
C00479 00254 ∂16-Aug-84 1056 CLT
C00480 00255 ∂16-Aug-84 1135 DFH S.J. Mercury reporter
C00481 00256 ∂16-Aug-84 1500 DAVIES@SU-SIERRA.ARPA Meeting?
C00483 00257 ∂16-Aug-84 1505 CLT
C00484 00258 ∂16-Aug-84 1521 ATP.BLEDSOE@UTEXAS-20.ARPA Bonuses
C00487 00259 ∂16-Aug-84 1754 GEORGEFF@SRI-AI.ARPA Workshop timetable
C00492 00260 ∂16-Aug-84 1806 LLW@S1-A.ARPA Discussion This Evening
C00494 00261 ∂16-Aug-84 1810 GEORGEFF@SRI-AI.ARPA Workshop Abstracts
C00531 00262 ∂16-Aug-84 1814 GEORGEFF@SRI-AI.ARPA Workshop
C00538 00263 ∂17-Aug-84 0147 Stefik.pa@Xerox.ARPA Re: Bonuses
C00541 00264 ∂17-Aug-84 0713 @MIT-MC:RICH@MIT-OZ Secretary/Treasurer
C00545 00265 ∂17-Aug-84 0830 JMC*
C00546 00266 ∂17-Aug-84 0904 HART@SRI-AI.ARPA Re: Secretary/Treasurer
C00549 00267 ∂17-Aug-84 0926 DFH
C00550 00268 ∂17-Aug-84 1027 DFH filing
C00551 00269 ∂17-Aug-84 1041 DFH phone calle
C00552 00270 ∂17-Aug-84 1124 GEORGEFF@SRI-AI.ARPA Workshop travel arrangements
C00554 00271 ∂17-Aug-84 1128 RPG Monterey
C00556 00272 ∂17-Aug-84 1153 NILSSON@SRI-AI.ARPA Re: Bonuses
C00559 00273 ∂17-Aug-84 1412 ullman@diablo
C00561 00274 ∂17-Aug-84 1504 VAL My paper on circumscription
C00562 00275 ∂17-Aug-84 1634 PW The WAITS Lisp Machine
C00563 00276 ∂17-Aug-84 1701 GOLUB@SU-SCORE.ARPA appointment of Perlis
C00568 00277 ∂17-Aug-84 2044 ALMQUIST@SU-SCORE.ARPA Re: S1 & NCC
C00572 00278 ∂17-Aug-84 2100 JMC*
C00573 00279 ∂18-Aug-84 1041 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
C00574 00280 ∂18-Aug-84 1116 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Bonuses
C00578 00281 ∂20-Aug-84 0818 LCG.CRISPIN@DEC-MARLBORO.ARPA favors
C00581 00282 ∂20-Aug-84 0839 DFH
C00582 00283 ∂20-Aug-84 0909 GOLUB@SU-SCORE.ARPA Library Keys
C00584 00284 ∂20-Aug-84 0922 DFH Appointment Wed.
C00585 00285 ∂20-Aug-84 0930 GOLUB@SU-SCORE.ARPA Lunch
C00586 00286 ∂20-Aug-84 0932 GOLUB@SU-SCORE.ARPA Papers
C00587 00287 ∂20-Aug-84 0949 MCDERMOTT@YALE.ARPA Re: "non-monotonic"
C00589 00288 ∂20-Aug-84 1000 JMC*
C00590 00289 ∂20-Aug-84 1018 GOLUB@SU-SCORE.ARPA Re: Promotion papers
C00592 00290 ∂20-Aug-84 1120 perlis@maryland AIWEEK
C00603 00291 ∂20-Aug-84 1122 NILSSON@SRI-AI.ARPA Error
C00605 00292 ∂20-Aug-84 1147 perlis@maryland.arpa AIWEEK
C00617 00293 ∂20-Aug-84 1155 PW telnet to the 3600s
C00619 00294 ∂20-Aug-84 1750 HOBBS@SRI-AI.ARPA Last meeting
C00620 00295 ∂20-Aug-84 1818 PW Common Lisp on the 3600s
C00622 00296 ∂20-Aug-84 1901 ATP.BLEDSOE@UTEXAS-20.ARPA Re: workshop on combining AI and numerical computation
C00624 00297 ∂20-Aug-84 2326 @SRI-AI.ARPA:BRATMAN@SU-CSLI.ARPA reminder
C00626 00298 ∂21-Aug-84 0042 talmy%ucbkim@Berkeley debate with Searle
C00630 00299 ∂21-Aug-84 0846 TWALKER@SRI-AI.ARPA "Farewell Luncheon" for "COMMONSENSE STUDENTS"
C00632 00300 ∂21-Aug-84 0919 MULLEN@SUMEX-AIM.ARPA SIGLUNCH--This week there will be a RIPLUNCH-Friday, Aug.24, 1984
C00635 00301 ∂21-Aug-84 1402 TWALKER@SRI-AI.ARPA "New Location" for FAREWELL LUNCHEON
C00637 00302 ∂21-Aug-84 1437 greep@SU-DSN Editor as top-level
C00646 00303 ∂21-Aug-84 1524 sato@SU-Russell Data Media
C00647 00304 ∂21-Aug-84 1548 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA Project F4
C00650 00305 ∂21-Aug-84 1908 YOM
C00651 00306 ∂21-Aug-84 1928 Brachman@SRI-KL.ARPA Congratulations and thanks
C00654 00307 ∂21-Aug-84 2242 GOLUB@SU-SCORE.ARPA Re: Lunch
C00655 00308 ∂22-Aug-84 0702 MASON@SU-SCORE.ARPA unification
C00658 00309 ∂22-Aug-84 0906 HOBBS@SRI-AI.ARPA Meeting reminder
C00659 00310 ∂22-Aug-84 0917 A.SANDY@SU-GSB-HOW.ARPA Re: DEST
C00660 00311 ∂22-Aug-84 1005 CLT opera
C00661 00312 ∂22-Aug-84 1327 GOGUEN@SRI-AI.ARPA teaching
C00663 00313 ∂22-Aug-84 1506 CLT
C00664 00314 ∂22-Aug-84 1601 CLT
C00666 00315 ∂22-Aug-84 1732 PW 3600s ↔ SAIL
C00669 00316 ∂22-Aug-84 1802 GOLUB@SU-SCORE.ARPA Meeting with Spencer
C00670 00317 ∂22-Aug-84 2258 GOLUB@SU-SCORE.ARPA Re: Meeting with Spencer
C00672 00318 ∂23-Aug-84 0900 JMC*
C00673 00319 ∂23-Aug-84 1012 PACK@SRI-AI.ARPA Kinds
C00674 00320 ∂23-Aug-84 1103 talmy%ucbkim@Berkeley the you/Searle discussion
C00677 00321 ∂23-Aug-84 1807 RINDFLEISCH@SUMEX-AIM.ARPA TI Hardware
C00679 00322 ∂23-Aug-84 2215 talmy%ucbkim@Berkeley 2nd talk
C00681 00323 ∂24-Aug-84 0918 GOLUB@SU-SCORE.ARPA lunch
C00682 00324 ∂24-Aug-84 1039 HOBBS@SRI-AI.ARPA Your thoughts
C00683 00325 ∂24-Aug-84 1136 ULLMAN@SU-SCORE.ARPA mail troubles
C00684 00326 ∂24-Aug-84 1255 ULLMAN@SU-SCORE.ARPA Re: ultracomputer offer
C00686 00327 ∂24-Aug-84 1433 ULLMAN@SU-SCORE.ARPA Re: ultracomputer offer
C00688 00328 ∂25-Aug-84 0108 ME DM2500 phone cord
C00689 00329 ∂25-Aug-84 1023 talmy%ucbkim@Berkeley your 2nd talk
C00691 00330 ∂25-Aug-84 1144 CLT
C00692 00331 ∂26-Aug-84 1114 FEIGENBAUM@SUMEX-AIM.ARPA [Jeff Ullman <ullman@diablo>:]
C00694 00332 ∂26-Aug-84 1506 JL05@CMU-CS-A.ARPA Kuo return soon.
C00696 00333 ∂27-Aug-84 1012 TWALKER@SRI-AI.ARPA "Luncheon Reminder"
C00697 00334 ∂27-Aug-84 1027 GOTELLI@SU-SCORE.ARPA Re: my account
C00699 00335 ∂27-Aug-84 1330 CLT tex equations
C00700 00336 ∂27-Aug-84 1359 RA selfridge
C00701 00337 ∂27-Aug-84 1418 RA Alex Jacobson
C00702 00338 ∂27-Aug-84 1504 EDMISTEN@SUMEX-AIM.ARPA ANNOUNCEMENT FOR FRIDAY, AUGUST 31, 1984
C00705 00339 ∂27-Aug-84 1639 LERMAN@SRI-KL.ARPA Re: By-laws
C00707 00340 ∂27-Aug-84 2033 ME RA and SCY priv
C00708 00341 ∂28-Aug-84 0946 AAAI-OFFICE@SUMEX-AIM.ARPA Basic Research Committee
C00710 00342 ∂28-Aug-84 1240 CLT
C00711 00343 ∂28-Aug-84 1332 RA Allan McKean
C00712 00344 ∂28-Aug-84 1646 RA LISP manuals
C00713 00345 ∂29-Aug-84 0900 JMC*
C00714 00346 ∂29-Aug-84 0925 RA CS206
C00715 00347 ∂29-Aug-84 0945 JK
C00716 00348 ∂29-Aug-84 1358 RA Roy D. Souza
C00717 00349 ∂29-Aug-84 1406 REGES@SU-SCORE.ARPA Re: Fascist computer programs
C00720 00350 ∂29-Aug-84 1421 ARK Re: Fascist computer programs
C00722 00351 ∂29-Aug-84 1445 RA Lester Ernest
C00723 00352 ∂29-Aug-84 1447 RA Parking
C00724 00353 ∂29-Aug-84 1533 Mailer failed mail returned
C00725 00354 ∂29-Aug-84 1622 REGES@SU-SCORE.ARPA Mailing
C00727 00355 ∂29-Aug-84 2000 JMC*
C00728 00356 ∂29-Aug-84 2211 JK
C00729 00357 ∂30-Aug-84 0705 JK
C00730 00358 ∂30-Aug-84 0934 RA
C00731 00359 ∂30-Aug-84 0938 avg@Navajo Re: Fascist computer programs
C00734 00360 ∂30-Aug-84 1148 RA
C00735 00361 ∂30-Aug-84 1204 RA D. Souza about your CS206
C00736 00362 ∂30-Aug-84 1330 RA
C00737 00363 ∂30-Aug-84 1515 RA
C00738 00364 ∂30-Aug-84 1554 RA
C00739 00365 ∂30-Aug-84 1639 EMMA@SU-CSLI.ARPA New forms
C00742 00366 ∂30-Aug-84 1900 JMC*
C00743 00367 ∂30-Aug-84 2321 talmy%ucbkim@Berkeley directions
C00746 00368 ∂31-Aug-84 0813 BSCOTT@SU-SCORE.ARPA Re: damage by carpet cleaners
C00747 00369 ∂31-Aug-84 1307 RA
C00748 00370 ∂01-Sep-84 1841 ME Prancing Pony Bill
C00764 00371 ∂02-Sep-84 1650 MXB upcoming panel discussion
C00766 00372 ∂02-Sep-84 1701 MXB identification
C00767 00373 ∂02-Sep-84 1709 MXB more on the panel
C00770 00374 ∂02-Sep-84 1715 MXB Severo
C00771 00375 ∂02-Sep-84 1722 MXB more
C00773 00376 ∂03-Sep-84 1602 chertok%ucbkim@Berkeley Berkeley Cognitive Science Seminar--Sept. 4
C00776 00377 ∂03-Sep-84 2238 RTC Common Lisp OS
C00777 00378 ∂04-Sep-84 0846 RA
C00778 00379 ∂04-Sep-84 0908 RINDFLEISCH@SUMEX-AIM.ARPA Re: TI Hardware
C00780 00380 ∂04-Sep-84 1200 RA
C00781 00381 ∂04-Sep-84 1238 RA
C00782 00382 ∂04-Sep-84 1259 LEIB@SU-SCORE.ARPA Another one.
C00783 00383 ∂04-Sep-84 1446 RA
C00785 00384 ∂04-Sep-84 1600 RA
C00786 00385 ∂04-Sep-84 1619 MRC@SU-SCORE.ARPA Happy Birthday
C00787 00386 ∂04-Sep-84 1725 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley better mail route
C00790 00387 ∂04-Sep-84 1943 EDMISTEN@SUMEX-AIM.ARPA NONE
C00791 00388 ∂05-Sep-84 0841 GARDNER@SU-SCORE.ARPA CBCL
C00792 00389 ∂05-Sep-84 0900 RA William Gosper card
C00793 00390 ∂05-Sep-84 0918 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting time
C00794 00391 ∂05-Sep-84 1057 RA
C00795 00392 ∂05-Sep-84 1117 RA
C00796 00393 ∂05-Sep-84 1348 RA iii invoice
C00797 00394 ∂05-Sep-84 1356 RA
C00798 00395 ∂05-Sep-84 1406 RA
C00799 00396 ∂05-Sep-84 1656 REGES@SU-SCORE.ARPA
C00801 00397 ∂06-Sep-84 1115 BSCOTT@SU-SCORE.ARPA Bruce Barnes
C00802 00398 ∂06-Sep-84 1222 chertok%ucbkim@Berkeley UCB Cognitive Science Seminar--Sept. 11
C00805 00399 ∂06-Sep-84 1331 RA
C00806 00400 ∂06-Sep-84 1449 RA
C00807 00401 ∂06-Sep-84 1541 RA
C00808 00402 ∂06-Sep-84 1545 RA
C00809 00403 ∂06-Sep-84 1642 A.SANDY@SU-GSB-HOW.ARPA Re: TIMM
C00810 00404 ∂06-Sep-84 1643 A.SANDY@SU-GSB-HOW.ARPA Re: TIMM
C00811 00405 ∂06-Sep-84 1658 ullman@diablo HEP
C00812 00406 ∂06-Sep-84 1801 GOLUB@SU-SCORE.ARPA
C00813 00407 ∂07-Sep-84 0129 REGES@SU-SCORE.ARPA accounts/mail for new CS students
C00817 00408 ∂07-Sep-84 0539 KAHN@USC-ISI.ARPA Re: HEP
C00819 00409 ∂07-Sep-84 1007 RA Office Automation brochure you were looking for
C00820 00410 ∂07-Sep-84 1021 RA
C00821 00411 ∂07-Sep-84 1143 RA
C00822 00412 ∂07-Sep-84 1152 GOLUB@SU-SCORE.ARPA Misc.
C00824 00413 ∂07-Sep-84 1204 GOLUB@SU-SCORE.ARPA Reception
C00825 00414 ∂07-Sep-84 1451 RA
C00826 00415 ∂07-Sep-84 1502 GOLUB@SU-SCORE.ARPA reminder
C00827 00416 ∂08-Sep-84 2120 JOHN@SU-CSLI.ARPA proposal from moore and perry
C00829 00417 ∂09-Sep-84 1407 FEIGENBAUM@SUMEX-AIM.ARPA meeting re Denelcor to support our research
C00831 00418 ∂09-Sep-84 2300 FEIGENBAUM@SUMEX-AIM.ARPA
C00833 00419 ∂10-Sep-84 0854 RINDFLEISCH@SUMEX-AIM.ARPA Re: meeting re Denelcor to support our research
C00834 00420 ∂10-Sep-84 0905 RA
C00835 00421 ∂10-Sep-84 0955 EDMISTEN@SUMEX-AIM.ARPA ANNOUNCEMENT
C00836 00422 ∂10-Sep-84 1031 CLT flood
C00837 00423 ∂10-Sep-84 1040 RA
C00838 00424 ∂10-Sep-84 1341 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA first meeting
C00839 00425 ∂10-Sep-84 1451 KAHN@USC-ISI.ARPA Re: hep
C00841 00426 ∂10-Sep-84 1459 ARK Ross Casley
C00842 00427 ∂10-Sep-84 1602 ullman@diablo meeting
C00843 00428 ∂10-Sep-84 1643 RA
C00844 00429 ∂10-Sep-84 1716 ASUBRAMANIAN@SUMEX-AIM.ARPA Programming project ??
C00846 00430 ∂10-Sep-84 1718 ASUBRAMANIAN@SUMEX-AIM.ARPA Replies to the previous message ...
C00847 00431 ∂10-Sep-84 1946 DEK Steen's editorial
C00849 00432 ∂10-Sep-84 2054 jlh@su-shasta.arpa HEP lunch
C00850 00433 ∂10-Sep-84 2138 cheriton@Pescadero Re: meeting
C00851 00434 ∂11-Sep-84 0006 jlh@su-shasta.arpa Re: meeting
C00852 00435 ∂11-Sep-84 0844 RA
C00853 00436 ∂11-Sep-84 1102 JMC*
C00854 00437 ∂11-Sep-84 1120 EMMA@SU-CSLI.ARPA New mailing list
C00856 00438 ∂11-Sep-84 1122 IAM
C00857 00439 ∂11-Sep-84 1440 GOGUEN@SRI-AI.ARPA teaching
C00859 00440 ∂11-Sep-84 1504 ERIC@SU-CSLI.ARPA Re: forward mail
C00860 00441 ∂11-Sep-84 1520 RA mail
C00861 00442 ∂11-Sep-84 1522 KAHN@USC-ISI.ARPA Re: Encore vs. HEP
C00864 00443 ∂11-Sep-84 1611 RA
C00865 00444 ∂12-Sep-84 0327 SIMONDS@CMU-CS-C.ARPA Re: my next trip to Paris
C00866 00445 ∂12-Sep-84 1051 RA
C00867 00446 ∂12-Sep-84 1142 RA
C00868 00447 ∂12-Sep-84 1213 RA
C00869 00448 ∂12-Sep-84 1420 ullman@diablo CSD-CF charges
C00870 00449 ∂12-Sep-84 1420 ullman@diablo
C00873 00450 ∂12-Sep-84 1517 ASHOK@SU-SCORE.ARPA
C00874 00451 ∂12-Sep-84 1531 RA transcriber
C00875 00452 ∂12-Sep-84 1718 talmy%ucbkim@Berkeley critique of Commonsense Summer
C00901 00453 ∂12-Sep-84 1847 halpern.sjrlvm1%ibm-sj.csnet@csnet-relay.arpa conference description + list of names
C00912 00454 ∂12-Sep-84 2113 JK
C00914 00455 ∂13-Sep-84 0657 SIMONDS@CMU-CS-C.ARPA Re: my next trip to Paris
C00915 00456 ∂13-Sep-84 0707 KAHN@USC-ISI.ARPA
C00917 00457 ∂13-Sep-84 0830 JK
C00919 00458 ∂13-Sep-84 0901 RA Your sept 17 trip
C00920 00459 ∂13-Sep-84 0919 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley panel discussion at San Jose
C00922 00460 ∂13-Sep-84 1118 RA Gross Dictionary of Music
C00923 00461 ∂13-Sep-84 1131 RA Your car
C00924 00462 ∂13-Sep-84 1334 RINDFLEISCH@SUMEX-AIM.ARPA HPP Input for HEP Proposal
C00932 00463 ∂13-Sep-84 1351 RA
C00933 00464 ∂13-Sep-84 1515 RA
C00934 00465 ∂13-Sep-84 1544 RA
C00935 00466 ∂13-Sep-84 1600 CLT
C00936 00467 ∂13-Sep-84 1652 BSCOTT@SU-SCORE.ARPA Gunnar Sjodin
C00937 00468 ∂13-Sep-84 1713 BSCOTT@SU-SCORE.ARPA
C00939 00469 ∂13-Sep-84 2134 chertok%ucbkim@Berkeley UCB Cognitive Science Seminar--Sept. 18
C00946 00470 ∂14-Sep-84 0800 JMC*
C00947 00471 ∂14-Sep-84 0821 GARDNER@SUMEX-AIM.ARPA CBCL
C00948 00472 ∂14-Sep-84 0824 BSCOTT@SU-SCORE.ARPA Re: sjoddin
C00949 00473 ∂14-Sep-84 1052 RA Students' appointments
C00950 00474 ∂14-Sep-84 1147 JK Lucid
C00951 00475 ∂14-Sep-84 1202 RA
C00952 00476 ∂14-Sep-84 1208 RA
C00953 00477 ∂14-Sep-84 1259 minker@maryland Exchange Papers
C01008 00478 ∂14-Sep-84 1259 GARDNER@SUMEX-AIM.ARPA Re: cbcl
C01009 00479 ∂14-Sep-84 1344 RA
C01010 00480 ∂14-Sep-84 1622 GARDNER@SUMEX-AIM.ARPA Re: SRI
C01011 00481 ∂14-Sep-84 1649 BARWISE@SU-CSLI.ARPA Area F Co-ordinator
C01012 00482 ∂14-Sep-84 1717 EMMA@SU-CSLI.ARPA recent rumor
C01013 00483 ∂15-Sep-84 0934 GARDNER@SUMEX-AIM.ARPA Re: fellowship opportunity
C01014 00484 ∂16-Sep-84 1814 ornstein.PA@Xerox.ARPA Re: panel discussion at San Jose
C01015 00485 ∂16-Sep-84 2200 JK reminder
C01016 00486 ∂17-Sep-84 0730 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa joint work
C01018 00487 ∂17-Sep-84 0800 JMC*
C01019 00488 ∂17-Sep-84 0928 EDMISTEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT FOR 9/21/84
C01020 00489 ∂17-Sep-84 0939 MORGAN@SU-CSLI.ARPA Appointment papers
C01022 00490 ∂17-Sep-84 1024 RESTIVO@SU-SCORE.ARPA paper trails
C01023 00491 ∂17-Sep-84 1030 JMC*
C01024 00492 ∂17-Sep-84 1100 JMC*
C01025 00493 ∂17-Sep-84 1106 RESTIVO@SU-SCORE.ARPA
C01026 00494 ∂17-Sep-84 1146 RA Talk about common sense in the Law School
C01027 00495 ∂17-Sep-84 1334 RINDFLEISCH@SUMEX-AIM.ARPA TI Open House at ACM
C01029 00496 ∂17-Sep-84 1356 ullman@diablo HEP proposal
C01030 00497 ∂17-Sep-84 1356 ullman@diablo
C01037 00498 ∂17-Sep-84 1426 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa contract
C01039 00499 ∂17-Sep-84 1450 KAHN@USC-ISI.ARPA hep package
C01047 00500 ∂17-Sep-84 1621 ullman@diablo Bell grant
C01048 00501 ∂17-Sep-84 1852 GARDNER@SUMEX-AIM.ARPA Re: Bell grant
C01050 00502 ∂17-Sep-84 2026 ullman@diablo Bell
C01051 00503 ∂18-Sep-84 1038 SHORTLIFFE@SUMEX-AIM.ARPA AAAI-M representative to AAMSI Congress
C01053 00504 ∂18-Sep-84 1114 JAMIE@SU-CSLI.ARPA Message from Nannette Morgan
C01054 00505 ∂18-Sep-84 1347 BARWISE@SU-CSLI.ARPA Guggenheim applications
C01056 00506 ∂19-Sep-84 0926 BARWISE@SU-CSLI.ARPA Tea today
C01057 00507 ∂19-Sep-84 0941 @SU-CSLI.ARPA:TW@SU-AI.ARPA Emergency
C01059 00508 ∂19-Sep-84 0953 RA
C01060 00509 ∂19-Sep-84 1139 RA Your trip to Marseille
C01061 00510 ∂19-Sep-84 1247 kateveni@su-shasta.arpa Advice on Colloquium speakers ?
C01065 00511 ∂19-Sep-84 1636 DFH
C01066 00512 ∂19-Sep-84 1647 DFH
C01067 ENDMK
C⊗;
∂03-Jul-84 1139 HST visit
hi john.i'm in cambridge now.did you receive a copy of my paper?
i heard some copies were mailed eroneously not by airmail.
there are many errors(printing) in it but it's all my knowledge.
my hope to find the new york herald tribune articel from 4/24/58 in minsky's
stock could not be realized until now.it is vanished.however gloria promised
to have saved may old pictures..i found another interesting(?)object:
the distribution list of the memos 3,4,5,6,7,8(1958).Again i'm convinced
that somehow all your correspondence of 1961-62 remained here (and is saved
in minsky's archieve.please inform me if i should send you another copy of
the history paper.herbert
∂03-Jul-84 1327 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 July 1984
Previous Balance 1.37
Monthly Interest at 1.5% 0.02
-------
TOTAL AMOUNT DUE 1.39
Please deliver payments to Fran Larson, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂03-Jul-84 1636 @SU-SCORE.ARPA:NILSSON@SRI-AI.ARPA New Circum Paper
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 3 Jul 84 16:35:57 PDT
Received: from SRI-AI.ARPA by SU-SCORE.ARPA with TCP; Tue 3 Jul 84 16:34:54-PDT
Date: Tue 3 Jul 84 16:35:47-PDT
From: NILSSON@SRI-AI.ARPA
Subject: New Circum Paper
To: jmc@SU-SCORE.ARPA
cc: nilsson@SRI-AI.ARPA
Do you have a copy of your new paper that you could send me? (I
have a borrowed pub source file from Leslie Pack, but I'd like to
read the equations more easily.) Thanks, -Nils
-------
∂03-Jul-84 1848 AAAI-OFFICE@SUMEX-AIM.ARPA agenda
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 3 Jul 84 18:48:30 PDT
Date: Tue 3 Jul 84 18:47:26-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: agenda
To: jmc@SU-AI.ARPA, bledsoe@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John and Woody,
I'd like to send to the execomm members the time and location of the
meeting this week (because I know a few are about to take off for
the summer). I can send them the agenda later. OK?
Regards,
Claudia
-------
∂04-Jul-84 1217 RPG Visit
To: JMC@SU-AI.ARPA, burton@SU-NAVAJO.ARPA, kahn@USC-ISI.ARPA
Here are several possibilities:
Tuesday, July 24
Wednesday, July 25
Thursday, July 26
John and I want to visit IBM in Yorktown Heights either the day
before or the day after our talk, and I want to visit CMU either
the day before or the day after our talk.
-rpg-
∂04-Jul-84 1244 KAHN@USC-ISI.ARPA Re: Visit
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 4 Jul 84 12:44:29 PDT
Date: 4 Jul 1984 15:44-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: Visit
From: KAHN@USC-ISI.ARPA
To: RPG@SU-AI.ARPA
Cc: JMC@SU-AI.ARPA, burton@SU-NAVAJO.ARPA
Cc: kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA] 4-Jul-84 15:44:05.KAHN>
In-Reply-To: The message of 04 Jul 84 1217 PDT from Dick Gabriel <RPG@SU-AI.ARPA>
Dick,
tues the 24th at 2pm would work out best for me, but
if you prefer i can probably accomodate other times on the 24-26th.
bob
∂04-Jul-84 1400 JMC*
Call Miro.
∂04-Jul-84 1549 HST plander
not very much.wolfgang bibel should know more.as far as i know plander
is professor in bratislawa(Pressburg),specialized on robotics,
organizes this eastern ai-conference (which is held in smolenice)every year
and invites always wolfgang bibel.the program committee is strange(more
for honour than for knowledge).with the exception of bibel only unknown
western guys are in it.
i xcould ask bibel for more.however i'm not shure that he understands the
east (i eastern spy makes his circles in western germany and bible helps
him to get more success.the bulgarians organize an ai-conference with
the help of bibel and friends - the kgb is laughing loudly.
why the question - does he invite you for next year?
to confess:I never saw him.
∂04-Jul-84 1622 JMC
441-2700 room 311
∂04-Jul-84 2100 JMC*
Arnold on differential equations
∂04-Jul-84 2100 JMC*
hobbs jpaper
∂04-Jul-84 2101 CLT protection
if you will fix the protection on b2,jmc so i can
work, i will do so
∂05-Jul-84 0604 ATP.BLEDSOE@UTEXAS-20.ARPA Re: agenda
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 06:04:40 PDT
Date: Thu 5 Jul 84 08:04:26-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: agenda
To: AAAI-OFFICE@SUMEX-AIM.ARPA, jmc@SU-AI.ARPA, bledsoe@UTEXAS-20.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Tue 3 Jul 84 20:49:02-CDT
Yes is Alright with me too to delay sending the agenda. Woody
-------
∂05-Jul-84 0851 graham%ucbernie@Berkeley Re: Paper you sent to Cartwright for refereeing.
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 08:51:12 PDT
Received: from ucbernie.ARPA by UCB-VAX.ARPA (4.28/4.31)
id AA22192; Thu, 5 Jul 84 08:51:42 pdt
Received: by ucbernie.ARPA (4.28/4.30)
id AA05440; Thu, 5 Jul 84 08:51:24 pdt
Date: Thu, 5 Jul 84 08:51:24 pdt
From: graham%ucbernie@Berkeley (Susan Graham)
Message-Id: <8407051551.AA05440@ucbernie.ARPA>
To: JMC@SU-AI.ARPA, graham@Berkeley
Subject: Re: Paper you sent to Cartwright for refereeing.
Thanks for your help.
∂05-Jul-84 0900 JMC*
common sense paper, Dyson, book, circum paper
∂05-Jul-84 0904 HART@SRI-AI.ARPA Re: Post-Doctorate program
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 09:03:38 PDT
Date: Thu 5 Jul 84 09:02:22-PDT
From: HART@SRI-AI.ARPA
Subject: Re: Post-Doctorate program
To: AAAI-OFFICE@SUMEX-AIM.ARPA
cc: AMAREL@RUTGERS.ARPA, BRACHMAN@SRI-KL.ARPA, BUCHANAN@SUMEX-AIM.ARPA,
BLEDSOE@UTEXAS-20.ARPA, KRD@MIT-MC.ARPA, BENGELMORE@SRI-KL.ARPA,
LERMAN@SRI-KL.ARPA, GENESERETH@SUMEX-AIM.ARPA, GROSZ@SRI-AI.ARPA,
JMC@SU-AI.ARPA, MINSKY@MIT-MC.ARPA, NILSSON@SRI-AI.ARPA,
REDDY@CMU-CS-A.ARPA, STAN@SRI-AI.ARPA, STEFIK@PARC-MAXC.ARPA,
GJS@MIT-MC.ARPA, TENENBAUM@SRI-KL.ARPA, WALKER@SRI-AI.ARPA,
BONNIE.UPENN@UDEL-RELAY.ARPA, FIKES%USC-ECLD@USC-ECL.ARPA
In-Reply-To: Message from "AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>" of Mon 21 Nov 83 16:44:06-PST
A serious proposal has been made that the AAAI use surplus funds to support
one (or more) two-year post-doctoral fellowships. Such fellowships would
allow researchers to spend what may be their most productive years in an
institution of their choice, unfettered by the bureaucratic and funding
problems that often constrain research. The AAAI office has estimated the
cost of supporting one fellowship to be approximately $60,000 per year.
While the initiation of AAAI fellowships has obvious appeal, I find
the proposal difficult to support for one chief reason: It lacks
leverage. In today's climate, it is relatively easy to obtain funding
for both basic and applied research in any area of AI. In particular,
the funding already available for undirected research is large
compared to the AAAI's resources. Accordingly, I think it unlikely that
our fellowship(s), however well-intended, would make much of a global
difference in the rate of progress of AI research.
In casting about for ideas on how to get more leverage, I am impressed
by the extent to which well-posed, important problems can galvanize new
research activity and, hopefully, research results. In pure mathematics,
Hilbert proposed a list of problems around the turn of the century that
seemed to have had this effect. Perhaps it would be possible for some
concentrated thought to produce a comparable list of problems in AI.
To be useful, a problem on the "AI Hilbert-List" would have to satisfy
a number of conditions, such as the following:
1. Well-posed-- it should be possible for informed people
to agree when a solution has been found. (Thus, "the
representation problem" would not qualify.)
2. Require theoretical or conceptual advances, rather than
be based on real-world performance. (Thus, we would
exclude "first world-champion chess program" from our
list of problems.)
3. Constitute a "breakthrough" in AI. We are not interested
in minor theoretical advances, but in developments that can
change the shape of the field.
In an ideal world, I would wish to propose a list of problems satisfying
these sorts of conditions, and offer very substantial AAAI prizes for their
solution. In the real world, merely creating such a list seems to me a
formidable technical challenge. One way out of this dilemma is to bootstrap
ourselves-- in particular, to set forth the challenge of creating the list,
and offering a prize to anyone who can pose an acceptable problem.
(An interesting exercise for anyone wishing to construct an AI Hilbert-list
problem is the following. Think of a past research result that you believe
would merit a prize, and try to pose a problem for which this result is the
solution. For example, what is a crisp statement of a general problem whose
solution is the unification algorithm?)
To proceed further with this general idea, it might be useful to form
ad hoc discussion groups in the various AI specialties to see if any
consensus can be reached on the question of bootstrapping the bootstrap:
would we recognize a good problem statement if we saw it?
It is clear that this suggestion requires much work to flesh out, and
requires more work to administer than the alternative of agreeing on
fellowship recipients and spending our surplus funds in $120K chunks.
But I think that in this case "administer" means serious scientific
thinking more than red tape, and in any case the potential for catalyzing
a set of important advances in AI is large.
-------
∂05-Jul-84 1000 JMC*
bscott about Lifschitz
∂05-Jul-84 1047 AAAI-OFFICE@SUMEX-AIM.ARPA AAAI Executive Council Meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 10:47:34 PDT
Date: Thu 5 Jul 84 10:28:33-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: AAAI Executive Council Meeting
To: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Fikes%usc-ecld@USC-ECL.ARPA, Genesereth@SUMEX-AIM.ARPA,
Grosz@SRI-AI.ARPA, Hart@SRI-KL.ARPA, Lenat@SU-SCORE.ARPA, JMC@SU-AI.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, Rich@UTEXAS-20.ARPA,
Stan@SRI-AI.ARPA, Stefik@PARC-MAXC.ARPA, GJS@MIT-AI.ARPA,
Minsky@MIT-MC.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
Bonnie.upenn@UDEL-RELAY.ARPA, phw@MIT-MC.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
I'd like to notify you of the 1984 Executive Council meeting. It will
be held in the Performing Arts Center's Concert Hall Green Room
(ground level) at 7:00 p.m. on Wednesday, August 8. We plan to have
dinner from 7:00 to 8:15 p.m. with the remainder of the
evening devoted to the meeting. An agenda of the meeting will be
forthcoming.
Can you please RSVP regarding your attendance at the meeting and
dinner so that we can order the proper number of dinners?
I look forward to seeing you there.
Regards,
Claudia
-------
∂05-Jul-84 1545 BSCOTT@SU-SCORE.ARPA Two Items
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 15:44:53 PDT
Date: Thu 5 Jul 84 15:43:49-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Two Items
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
1. I have an applicant coming in at 4:30 today--sorry for the late notice.
I don't know whether she is someone you will want to talk with or not,
but if she appears to be possible, are you going to be around at about
4:45?
2. I had a call from the Patent Office at Sponsored Projects. They have asked
me to send a copy of your agreement with Comtex. I wanted you to know about
this request before I comply.
Betty
-------
∂05-Jul-84 1603 BSCOTT@SU-SCORE.ARPA Lifschitz
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 16:03:08 PDT
Date: Thu 5 Jul 84 15:57:50-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Lifschitz
To: JMC@SU-AI.ARPA
Did you mean salary or phone number? You told me previously $3,500/month.
Phone number is 415-857-1628.
I have to request approval to pay him, and have been waiting for his C.V.
I'll get this done over the next day or so. I'm assuming that $5,250 is
the total amount he will receive for 7/15 - 8/31, so this is what I'm request-
ing approval for.
Betty
-------
∂05-Jul-84 1700 BSCOTT@SU-SCORE.ARPA Applicant
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 17:00:30 PDT
Date: Thu 5 Jul 84 16:59:35-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Applicant
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
The applicant didn't show up for her appointment.
Betty
-------
∂05-Jul-84 1748 burton@Navajo Re: Visit
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 5 Jul 84 17:47:54 PDT
Date: Thu, 5 Jul 84 17:47 PDT
From: Burton Smith <burton@Navajo>
Subject: Re: Visit
To: JMC@Sail, RPG@Sail, kahn@USC-ISI.ARPA
Tuesday the 24th at 2 is fine with me.
∂06-Jul-84 0803 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 08:03:31 PDT
Date: Fri 6 Jul 84 08:02:41-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 5 Jul 84 13:42:00-PDT
I have forwarded the Ohlander message to Luckham, Hennessy, Manna and
Ullman, and also to Rindfleisch for his information. I sent a message to
Ohlander, telling him that Jeff is out of the country and won't return until
the 19th.
Betty
-------
∂06-Jul-84 0900 JMC*
return pushkin get Dumas
∂06-Jul-84 1008 DFH
To: JMC, DFH
Richard Fikes called to make lunch date with you and C. Mazzeti re AAAI.
Tentatively set for Wednesday, July 11. He will confirm. He wants to
speak to you before the meeting so asks you to call him at 853-5557.
∂06-Jul-84 1115 NITZAN@SRI-AI.ARPA Re: Ivan Plander
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 11:15:33 PDT
Date: Fri 6 Jul 84 11:17:19-PDT
From: NITZAN@SRI-AI.ARPA
Subject: Re: Ivan Plander
To: JMC@SU-AI.ARPA
cc: : ;
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 4 Jul 84 16:23:00-PDT
John,
SRI's security regulations for visitors of communist countries are very
strict--notification must be at least 10 days in advance in order to
obtain approval from the State Department.
I regret that Ivan Plander will be unable to visit SRI. Please give him
my best regards.
David
-------
∂06-Jul-84 1124 DFH
To: JMC, DFH
Louis Lehrman called. Will call back some afternoon.
∂06-Jul-84 1154 DFH
To: JMC, DFH
Which Sheraton hotel in NYC do you want? Towers, St. Regis, City Squire,
or Russell.
∂06-Jul-84 1225 HST greetings from mike levin
today i met mike levin (who is with lmi now)and he sends his best regards.
in the middle of marvin's stock(under headline minsky publications)i found
the draft(with your corrections)and the print matrice of memo1 (sept
58).At the same place was a letter from you to morse concerning time-sharing.
there were 2 versions:one mimeographed and dated at 1/1/59 and one dated
1/1/58.The content makes it clear that the date 1/1/58 must be false
because LISP is mentioned.
∂06-Jul-84 1400 JMC*
register for LISP conf.
∂05-Jul-84 1000 YM 1984 ACM Symposium on LISP and Functional Programming
To: su-bboards@SU-AI.ARPA
The conference will be held in Austin Texas August 5-8 the (same week as the
AAAI-84 conference).
The deadline for early registration is July 6th (tomorrow).
I have a few extra copies of the program and registration form.
-Yoni (MJH324)
∂06-Jul-84 1448 KAHN@USC-ISI.ARPA Re: Visit
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 14:48:42 PDT
Date: 6 Jul 1984 17:47-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: Visit
From: KAHN@USC-ISI.ARPA
To: burton@SU-NAVAJO.ARPA
Cc: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA] 6-Jul-84 17:47:59.KAHN>
In-Reply-To: The message of Thu, 5 Jul 84 17:47 PDT from Burton Smith <burton@Navajo>
ive tentatively marked the 24th at 2pm on my calendar
pending confirmation from everyone that its ok.
bob
∂06-Jul-84 1449 KAHN@USC-ISI.ARPA Re: visit
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 14:49:29 PDT
Date: 6 Jul 1984 17:49-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: visit
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: RPG@SU-AI.ARPA, burton@SU-NAVAJO.ARPA
Cc: kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA] 6-Jul-84 17:49:07.KAHN>
In-Reply-To: The message of 05 Jul 84 1755 PDT from John McCarthy <JMC@SU-AI.ARPA>
john,
ok. i think everyone has agreed to the 24th at 2 so
lets assume its finalized.
see you then
bob
∂06-Jul-84 1451 burton@Navajo Re: Visit
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 14:51:18 PDT
Date: Fri, 6 Jul 84 14:50 PDT
From: Burton Smith <burton@Navajo>
Subject: Re: Visit
To: KAHN@USC-ISI.ARPA
Cc: JMC@Sail, RPG@Sail, kahn@USC-ISI.ARPA
The 24th at 2 it is.
burton
∂06-Jul-84 1558 RPG Re: Visit
To: burton@SU-NAVAJO.ARPA, kahn@USC-ISI.ARPA
CC: JMC@SU-AI.ARPA
∂06-Jul-84 1448 KAHN@USC-ISI.ARPA Re: Visit
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 6 Jul 84 14:48:42 PDT
Date: 6 Jul 1984 17:47-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: Visit
From: KAHN@USC-ISI.ARPA
To: burton@SU-NAVAJO.ARPA
Cc: JMC@SU-AI.ARPA, RPG@SU-AI.ARPA, kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA] 6-Jul-84 17:47:59.KAHN>
In-Reply-To: The message of Thu, 5 Jul 84 17:47 PDT from Burton Smith <burton@Navajo>
ive tentatively marked the 24th at 2pm on my calendar
pending confirmation from everyone that its ok.
bob
I'll see you all at 2pm on July 24 at DARPA.
∂07-Jul-84 1234 WALKER@SRI-AI.ARPA Re: Post-Doctorate program
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 7 Jul 84 12:34:14 PDT
Date: Sat 7 Jul 84 12:34:05-PDT
From: Don Walker <WALKER@SRI-AI.ARPA>
Subject: Re: Post-Doctorate program
To: HART@SRI-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA, AMAREL@RUTGERS.ARPA, BRACHMAN@SRI-KL.ARPA,
BUCHANAN@SUMEX-AIM.ARPA, BLEDSOE@UTEXAS-20.ARPA, KRD@MIT-MC.ARPA,
BENGELMORE@SRI-KL.ARPA, LERMAN@SRI-KL.ARPA, GENESERETH@SUMEX-AIM.ARPA,
GROSZ@SRI-AI.ARPA, JMC@SU-AI.ARPA, MINSKY@MIT-MC.ARPA, NILSSON@SRI-AI.ARPA,
REDDY@CMU-CS-A.ARPA, STAN@SRI-AI.ARPA, STEFIK@PARC-MAXC.ARPA,
GJS@MIT-MC.ARPA, TENENBAUM@SRI-KL.ARPA, BONNIE.UPENN@UDEL-RELAY.ARPA,
FIKES%USC-ECLD@USC-ECL.ARPA
In-Reply-To: Message from "HART@SRI-AI.ARPA" of Thu 5 Jul 84 09:02:20-PDT
Any consideration of prizes by AAAI should take into consideration the work
already done by Raj for the IJCAII prizes. The chess and math ones are
well publicized, but others have also been delineated.
-------
∂08-Jul-84 0039 Mclure@sri-unix human vs. machine chess game for your perusal
Received: from SRI-UNIX.ARPA by SU-AI.ARPA with TCP; 8 Jul 84 00:39:14 PDT
Date: 7 Jul 84 2:56-PDT
From: mclure @ Sri-Unix.arpa
To: berliner @ Cmu-Cs-A.arpa, jmc @ Su-Ai.arpa,
research!ken @ Ucb-Vax.arpa, jim @ Rand-Unix.arpa, rg @ Mit-Mc.arpa
Subject: human vs. machine chess game for your perusal
Note 17 ... Ng3 by the machine.
Cracraft (1553/15) vs. Fidelity Prestige (6502 @ 4mhz)
Time control: 40 moves in 2 hours, 20 in 1
1. e4 c5 11. o-o Bb7 21. Kf1 Bd4
2. Nf3 Nc6 12. f3 Rd8 22. Ke1 Qe5
3. d4 cd4 13. Rd1 Qd4 23. Kf1 Qe3
4. Nd4 g6 14. Kh1 o-o 24. Rde1 Qg1
5. c4 Bg7 15. Nc3 Qc5 25. Ke2 Qg2
6. Nc6 bc6 16. Bf4 Nh5 26. Kd1 Qf3
7. Qc2 Nf6 17. Bd2 Ng3! 27. Kc1 Bc3
8. Bd3 d5 18. hg3 Qh5 28. resigns
9. ed5 cd5 19. Kg1 Bd4
10. cd5 Qd5 20. Be3 Be3
∂08-Jul-84 1233 @MIT-MC:MINSKY@MIT-OZ Very High Performance Computing
Received: from ROCHESTER.ARPA by SU-AI.ARPA with TCP; 8 Jul 84 12:33:07 PDT
Received: from ur-seneca.rochester.arpa (ur-seneca) by ur-cayuga.rochester.arpa id AA14094 (4.12f); Sun, 8 Jul 84 15:34:55 edt
Received: from ur-cayuga.rochester.arpa (ur-cayuga) by ur-seneca.rochester.arpa id AA28573 (4.12g); Sun, 8 Jul 84 15:31:44 edt
Received: from MIT-MC (mit-mc.arpa) by ur-cayuga.rochester.arpa id AA14088 (4.12f); Sun, 8 Jul 84 15:34:34 edt
Date: Sun, 8 Jul 1984 15:31 EDT
Message-Id: <MINSKY.12029739336.BABYL@MIT-OZ>
From: MINSKY%MIT-OZ@MIT-MC.ARPA
To: Rose Peet <rose@rochester.arpa>
Cc: ai-group@rochester.arpa, Others@rochester.arpa, minsky%MIT-OZ@MIT-MC.ARPA
Subject: Very High Performance Computing
In-Reply-To: Msg of 18 Jun 1984 15:47-EDT from Rose Peet <rose at rochester.arpa>
In my view, many lines of research in AI have been
limited by capacity. In the early days the memory problem was the
most serious one, because we couldn't load the programs or the
programming systems. This is still a problem with the
microcomputers, of course.
But brute compoutational capacity certain has retarded work on
studying large semantic networks and connectionistic systems.
This is perhaps why so little is still known about common sense
reasoning and learning.
In our haste to remedy this, though, let's not overlook the
critical problem of manpower. No amount of computation will
make new theories, unless the funding also
helps support people -- especially post-doctorates --
to work for several years on hard problems.
∂08-Jul-84 1646 CLT
is 1pm tomorrow ok for a book meeting? if not say when
∂09-Jul-84 0021 CLT please
could you not fiddle with a file when i'm working on it
You're pretty arrogant - characterizing what you do as working
and what I do as fiddling.
∂09-Jul-84 0100 JMC*
register for Lisp conference
∂09-Jul-84 0102 CLT chapter 1
To: JMC, IAM, RTC
is now texed. It is in three sections reada, readb, readc.
r latex;reada to tex section a etc. r latex;readin to tex the full chapter.
r divdov;readin to print the most recent dvi file.
∂09-Jul-84 0500 OHLANDER@USC-ISI.ARPA Re: accomplishments
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 04:58:01 PDT
Date: 9 Jul 1984 07:57-EDT
Sender: OHLANDER@USC-ISI.ARPA
Subject: Re: accomplishments
From: OHLANDER@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: RPG@SU-AI.ARPA, bscott@SU-SCORE.ARPA
Message-ID: <[USC-ISI.ARPA] 9-Jul-84 07:57:36.OHLANDER>
In-Reply-To: The message of 06 Jul 84 0133 PDT from John McCarthy <JMC@SU-AI.ARPA>
Thanks for your reply and for pulsing the others.
Ron
∂09-Jul-84 0927 BSCOTT@SU-SCORE.ARPA Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 09:27:09 PDT
Date: Mon 9 Jul 84 09:26:26-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Secretary
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I am trying to set up a noon-time appointment for an applicant, since she
can't come for an interview during regular office hours. I probably could
arrange a time after 5:00 also. Which would be preferable to you, providing
she proves to be worth interviewing?
Betty
-------
∂09-Jul-84 1037 HOBBS@SRI-AI.ARPA General Meeting of Commonsense Summer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 10:36:51 PDT
Date: Mon 9 Jul 84 10:38:29-PDT
From: HOBBS@SRI-AI.ARPA
Subject: General Meeting of Commonsense Summer
To: commonsense.people: ;
There will be another general meeting of Commonsense Summer this week--
Wednesday, July 11, at 10 am in the usual place, EK242 at SRI. We'll
continue discussing the work of the students.
-- Jerry
-------
∂09-Jul-84 1055 DFH
To: JMC, DFH
Please call V. Lifshitz. 969 3137
∂09-Jul-84 1100 JMC*
Register for Lisp conference.
∂09-Jul-84 1122 wilensky%ucbdali@Berkeley.arpa Re: Very High Performance Computing
Received: from ROCHESTER.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 11:21:48 PDT
Received: from ur-seneca.rochester.arpa (ur-seneca) by ur-cayuga.rochester.arpa id AA15722 (4.12f); Mon, 9 Jul 84 14:21:46 edt
Received: from ur-cayuga.rochester.arpa (ur-cayuga) by ur-seneca.rochester.arpa id AA07152 (4.12g); Mon, 9 Jul 84 14:18:24 edt
Received: from UCB-VAX.ARPA by ur-cayuga.rochester.arpa id AA15716 (4.12f); Mon, 9 Jul 84 14:21:09 edt
Received: from ucbdali.ARPA by UCB-VAX.ARPA (4.28/4.31)
id AA12696; Mon, 9 Jul 84 11:17:56 pdt
Received: by ucbdali.ARPA (4.28/4.27)
id AA09478; Mon, 9 Jul 84 11:17:44 pdt
Date: Mon, 9 Jul 84 11:17:44 pdt
From: wilensky%ucbdali@Berkeley.arpa (Robert Wilensky)
Message-Id: <8407091817.AA09478@ucbdali.ARPA>
To: MINSKY%MIT-OZ@MIT-MC.ARPA, rose@rochester.arpa
Subject: Re: Very High Performance Computing
Cc: minsky%MIT-OZ@MIT-MC.ARPA, Others@rochester.arpa, ai-group@rochester.arpa
Apropos of Minsky's comments, I think it should be emphasized that the basic
problems in the field are NOT those of computational capacity. Rather,
providing better computational resources will at best enable better
exploration of important problems. Of course, this is important. But given
infinite computational resources, we would still not know how to solve most
interesting problems.
Point - Don't expect too much from better machines, no matter how necessary
they are to further progress.
∂09-Jul-84 1325 ME news wires
∂08-Jul-84 2246 JMC
Both wires seem to be down.
ME - Well, they're up now, and I didn't do anything.
∂09-Jul-84 1424 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 13, 1984.
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 14:23:57 PDT
Date: Mon 9 Jul 84 14:15:34-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - July 13, 1984.
To: siglunch@SUMEX-AIM.ARPA
(PLEASE NOTE...This will be a short SIGLUNCH...it will only last
about 30 to 45 minutes)
SIGLUNCH
DATE: Friday, July 13, 1984
LOCATION: Braun Lecture Hall, Seeley Mudd Chemistry Bldg.
TIME: 12:05
SPEAKER: Jock Mackinlay
Stanford University
TOPIC: Expressiveness of Languages
ABSTRACT:
A key step in the design of user interface is the choice of a language
for presenting facts to the user. The spectrum of possible choices
ranges from general languages, such as predicate calculus, to more
specialized languages, such as maps, diagrams, and ad hoc languages.
General languages can express a broader range of facts than more
specialized languages, but specialized languages are more
parsimonious. The basic motivation for the research described in this
talk is to construct a presentation system that can automatically
choose an appropriate graphic language for presenting information to a
user.
This talk addresses two issues that must be considered when choosing a
language to represent or present a set of facts. First, a language
must be sufficiently expressive to state all the facts. Secondly, it
may have the property that when some collections of facts are stated
explicitly, additional facts are stated implicitly. Such a language
should not be chosen if these additional facts are not correct. We
first define when a fact is stated in a message. Using this
definition, we define when a set of facts is expressible in a
language. This definition can be used to determine whether a language
should be chosen to represent or present a set of facts. We also
consider the problem of choosing between languages that are
sufficiently expressible for a set of facts. Two criteria are
considered: the cost of constructing a message and the cost of
interpreting a message.
-------
∂09-Jul-84 1732 MADSEN@SU-CSLI.ARPA Interview
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 17:31:41 PDT
Date: Mon 9 Jul 84 09:18:04-PDT
From: Ole Lehrmann Madsen <MADSEN@SU-CSLI.ARPA>
Subject: Interview
To: jmc@SU-AI.ARPA
cc: madsen@SU-CSLI.ARPA
On July 12-16 a journalist, Per Torbo, from the Norwegian Radio and Television
is visiting this area. He is going to interview various people about their
view on computing, personal computers, what we can expect of computers in the
future, etc. He is very interested in getting an interview with you.
Will this be possible? If so please let me know when you are available.
Unfortunately I don't know his exact schedule, but I hope that it will be
possible to work out a time. In Scandinavia the public information on the use
of computers is very limited and often inaccurate. I am sure that an interview
with you will be a very useful contribution.
Thank you very much. Ole Lehrmann Madsen, MJH 241, tlf. 494-0364.
-------
∂09-Jul-84 2130 minker@umcp-cs.arpa Math Year Schedule
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 21:29:58 PDT
Received: From umcp-cs.csnet by csnet-relay; 10 Jul 84 0:12 EDT
Date: 9 Jul 84 22:28:39 EDT (Mon)
From: JACK MINKER <minker@umcp-cs.arpa>
Subject: Math Year Schedule
To: JMC@su-ai.arpa
I have received the title of talks from Barwise, Henschen, Reiter and
Van Emden. They all plan to stay for the entire week. Can you send me
the title of your talk so that I can arrange the lecture sequence.
Don Perlis enjoyed his trip to the West Coast and in particular the
opportunity to interact with you and your students.
Best regards,
Jack
∂09-Jul-84 2223 TREITEL@SUMEX-AIM.ARPA re: : Nuclear lunch 7/10 - food for thought (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Jul 84 22:23:34 PDT
Date: Mon 9 Jul 84 22:22:58-PDT
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: : Nuclear lunch 7/10 - food for thought (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: SU-BBOARDS@SU-AI.ARPA, treitel@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 9 Jul 84 17:35:00-PDT
Well good heavens, do you expect them to invite people who disagree with them?
What would be interesting would be if I could eavesdrop unobserved on a "peace"
group meeting at which one of their members was chosen to play devil's advocate
and present the views of the other side as convincingly as they could.
- Richard
P.S. admittedly there might be confusion about which other side was meant.
But this is one of the lessons they have to learn (that there is a diversity of
views among those who disagree with them).
-------
∂10-Jul-84 1054 IAM
i am goingg to hack readc...iam
∂10-Jul-84 1124 IAM
did the new LATEX muck things up? i will be hacking all three readin's
∂10-Jul-84 1304 DFH
To: JMC, DFH
Meredith Stelling (617 426 2800) called from the Computer Museum in Boston
where you donated a film on time-sharing. She wants to have your permission
to use it in an exhibit where one pushes a button and the film is shown.
Address is 300 Congress St., Boston 02210
∂10-Jul-84 1832 CLT meetings
To: "@BOO.DIS[B2,JMC]"
wed 11 july 3pm full committee chapter II
thu 12 july 3pm iam+jmc chapter III
fri 13 july 1pm actors seminar
∂11-Jul-84 0017 ARK I've never heard of such a rule...who told him?
∂10-Jul-84 1635 @SU-SCORE.ARPA:JMC@SU-AI.ARPA why people flee
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Jul 84 16:35:31 PDT
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Tue 10 Jul 84 16:32:52-PDT
Date: 10 Jul 84 1630 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: why people flee
To: faculty@SU-SCORE.ARPA
Today a student, Daniel Shapiro, came requesting that I be on his orals
committee, because his previous proposed committee had been rejected on
the grounds that it included only people interested in the thesis area,
and we had some regulation against it. This is one more example of how
well intended rules create a situation in which faculty have to leave
town in order to get some research done.
∂11-Jul-84 0019 ARK Previous message
Perhaps someone is confusing thesis committee with orals committee.
(You don't usually get to pick the outside members of the latter, and
you don't need any on the former. You do need two academic council members
though.) So I think someone is wedged.
Arthur
∂11-Jul-84 0028 ARK Rereading
Now, I've reread the message carefully. Someone really blew it.
The orals committee is the thesis committee (the three members)
plus the outside member of the dept. plus someone outside the
dept. The dept. secy chooses the dept random and someone from
graduate pgm office chooses the other. I don't know why Daniel
was asking you to be on his orals committee, but it's likely because
someone filling it for Marilynn (on vacation?) doesn't know the ropes.
Arthur
∂11-Jul-84 0031 ARK orals
∂11-Jul-84 0030 JMC
He quizzed me carefully to be sure I wasn't interested before he asked.
ARK - My point (finally) is that it isn't his place to ask. No one
*wants* to be Prof. Random on orals committee. The student isn't
supposed to find someone.
∂11-Jul-84 0049 cheriton@Navajo Re: why people flee
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 11 Jul 84 00:49:20 PDT
Date: Wed, 11 Jul 84 00:48 PDT
From: David Cheriton <cheriton@Navajo>
Subject: Re: why people flee
To: JMC@SU-AI.ARPA
Surely, you could claim you were also very interested in the thesis area
and therefore couldnt do it either?
∂11-Jul-84 0906 AAAI-OFFICE@SUMEX-AIM.ARPA [Bonnie Webber <Bonnie%upenn.csnet@csnet-relay.arpa>: AAAI Executive Council Meeting]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Jul 84 09:06:42 PDT
Date: Wed 11 Jul 84 09:05:56-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: [Bonnie Webber <Bonnie%upenn.csnet@csnet-relay.arpa>: AAAI Executive Council Meeting]
To: JMC@SU-AI.ARPA, AAAI-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Here is one more point for the agenda.
Claudia
---------------
Return-Path: <BONNIE%upenn.csnet@csnet-relay.arpa>
Received: from csnet-relay by SUMEX-AIM.ARPA with TCP; Wed 11 Jul 84 02:41:13-PDT
Received: From upenn.csnet by csnet-relay; 11 Jul 84 5:19 EDT
From: Bonnie Webber <Bonnie%upenn.csnet@csnet-relay.arpa>
Subject: AAAI Executive Council Meeting
To: AAAI <AAAI-OFFICE%sumex-aim.arpa@csnet-relay.csnet>
Date: Tue, 10 Jul 84 23:05 EDT
Claudia - I will be attending. I would also like to have an item put on
the agenda - discussion of changing the date of the annual meeting - i.e.,
moving it to some other month than August. I will prepare a short position
paper on the proposal and circulate it to the council members, if it can
be put on the agenda. So far, all the reaction I've gotten informally has
been positive.
B.
-------
∂11-Jul-84 1042 DFH
To: JMC, DFH
Ann Mayo of the Graduate Program Office called. She would like you to
chair an oral examination. Pls. call at 7-3056.
∂11-Jul-84 1100 CLT old latex
To: "@BOO.DIS[B2,JMC]"
has been restored (to b2,jmc)
to tex book files - say reada
.al b2,jmc
.ru latex;reada
NOTE ru NOT r
to use old latex from your area
.ru latex[b2,jmc];filename
∂11-Jul-84 1147 AAAI-OFFICE@SUMEX-AIM.ARPA election results
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Jul 84 11:47:02 PDT
Date: Wed 11 Jul 84 10:48:30-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: election results
To: JMC@SU-AI.ARPA, Nilsson@SRI-AI.ARPA, Bledsoe@UTEXAS-20.ARPA,
Fikes%usc-ecld@USC-ECL.ARPA, Walker@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
We've just finished the compilation of the election ballots for
the President-elect (1985-86) and the four councilors seats.
Here are the results:
* Out of total of 5,000 ballots mailed out, 1,170 people voted
or ~23% of the membership.
* For the President-elect seat, Pat Winston received 94% or 1,111
votes. About 4% were write-ins votes and 2% abstained from voting.
A frequent comment was to have more than one nominee for this
position.
* For the four Councilor seats, here is the break-down:
*John McDermott - 70% or 821 votes
*Edward Shortliffe - 53% or 627 votes
*Charles Rich - 46% or 539 votes
*Ron Brachman - 44% or 517 votes
* The other nominees received the following votes:
*Candace Sidner - 508 votes
*Dick Duda - 494 votes
*C. Ray. Perrault - 345 votes
*R. Bajcsy - 250 votes
* write-ins - 4%
I plan to send the winners a msg this afternoon about their election
to the Council.
Regards,
Claudia
-------
∂11-Jul-84 1330 DFH
To: JMC, DFH
Sarah called and asks that you call her - quite urgent. Either at home or at
the Barn, 322 5713.
∂11-Jul-84 1357 DFH
To: JMC, DFH
Prof. Floyd stopped by. He is looking for a professor in an unrelated area
to be on an orals committee on Aug. 2.
∂11-Jul-84 1841 RPG
We'll see ohlander and squires at 12:30 at DARPA.
∂11-Jul-84 2019 AAAI-OFFICE@SUMEX-AIM.ARPA draft agenda
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 11 Jul 84 20:19:24 PDT
Date: Wed 11 Jul 84 20:19:05-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: draft agenda
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, bledsoe@UTEXAS-20.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Can you add to your distribution list Danny Bobrow and Ed Feigenbaum?
Thanks,
Claudia
John,
Here is the draft agenda for the meeting:
Chaired by John McCarthy, President
STAFF REPORTS
* Financial Reports - Raj or Richard
* Administrative - Claudia
COMMITTEE/PROGRAM REPORTS
* Election Results - Nils
* 1984 Technical Program - Ron Brachman
* 1984 Tutorial Program - Doug Lenat
* Membership Committee - Bruce Buchanan
* Publications Committee - Lee Erman
* IJCAI-85 Report - Saul Amarel
* Conference Committee - Marty Tenenbaum
* future sites
* change in the time year for conference - Bonnie
Lynn Webber
* Workshop Program - John McCarthy
PROPOSED PROJECTS
* On-line Library and abstract project - Mike Genesereth
* Fellowship Program - John McCarthy
* Prize Proposal - Peter Hart
TRANSFER OF PRESIDENCY TO WOODY BLEDSOE, PRESIDENT (1984-1985)
* New Workshop Proposals
* Long Range Planning for the association
-------
∂11-Jul-84 2040 RPG Penumvirate
After some analysis, I think the correct word is `quinquevirate.'
But I do not have a fancy dictionary at my side at the moment.
-rpg-
∂11-Jul-84 2115 RPG
∂11-Jul-84 2101 JMC
Your analysis is correct. The OED lists quinquevirate as "An
association, board, etc. consisting of five men". Their first
usage was in 1710. There is no penumvirate or anything beginning
with pent either.
The analysis went easily after I decided that `pent' was Greek and
`virate' was Latin. The `um' in `triumvirate' goes with the `tri'
as `trium.' I didn't have a dictionary that stated what the correct
form of `quin...' should be, so I had to guess.
-rpg-
∂12-Jul-84 0606 BARWISE@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 12 Jul 84 06:06:04 PDT
Date: Thu 12 Jul 84 06:00:59-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
cc: BARWISE@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 11 Jul 84 23:47:00-PDT
Lunch from 12:30 to 2 if you can possibly make it. Thanks, Jon
-------
∂12-Jul-84 0925 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 13, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 12 Jul 84 09:24:54 PDT
Date: Thu 12 Jul 84 08:31:30-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - July 13, 1984
To: siglunch@SUMEX-AIM.ARPA
Just a reminder...SIGLUNCH this Friday will be at Braun Lecture Hall, in
the Seeley Mudd Building...NOT the Gazebo.
-------
∂12-Jul-84 1453 BSCOTT@SU-SCORE.ARPA Applicant
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Jul 84 14:53:40 PDT
Date: Thu 12 Jul 84 14:50:53-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Applicant
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I have another applicant, John. She is free for interviewing tomorrow after-
noon. Would you have some free time between 1:30 and 5:00?
Betty
-------
∂12-Jul-84 1602 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Jul 84 16:02:11 PDT
Date: Thu 12 Jul 84 16:01:25-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 12 Jul 84 14:55:00-PDT
How about 2:00? Her name is Elizabeth (Beth) Moore.
Betty
-------
∂12-Jul-84 1643 Mailer failed mail returned
The following message has expired without successful delivery to recipient(s):
local-bboard-only@SU-DSN.ARPA
------- Begin undelivered message: -------
∂09-Jul-84 1735 JMC re: : Nuclear lunch 7/10 - food for thought (from SAIL's BBOARD)
To: OTHER-SU-BBOARDS@SU-AI.ARPA
jmc - Seems more that food for self congratulation is being offered
to people with correct views. I can't see that any "food for thought"
has been offered.
------- End undelivered message -------
∂12-Jul-84 1648 LERMAN@SRI-KL.ARPA AAAI publications committee meeting
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 12 Jul 84 16:48:02 PDT
Date: Thu 12 Jul 84 16:46:59-PDT
From: Lee Erman <LErman@SRI-KL.ARPA>
Subject: AAAI publications committee meeting
To: Amarel@RUTGERS.ARPA, Engelmore@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
Nilsson@SRI-AI.ARPA, Reddy@CMU-CS-A.ARPA, AAAI-office@SUMEX-AIM.ARPA,
Bobrow@XEROX.ARPA, Bledsoe@UTEXAS-20.ARPA
There will be a breakfast meeting of the AAAI publications committee at 7:30
a.m. on Wednesday, August 8, in the Ney Room of the Villa Capri Hotel. This
timing will allow us to bring up topics at the exec. comm. meeting later in
the day, if we have something substantive to report.
**** FOR OUR PLANNING PURPOSES, R.S.V.P. TO ME AND TO CLAUDIA.******
Agenda topics:
> AI Mag advertising policy
> Bob is currently imposing an informal 25% limit on advertisements.
Should we have a limit? What should it be?
> Assuming we do have a limit, what should be the policy for acceptance?
> Claudia is doing a bit of research to see what other comparable mags do.
> AI Mag copyrights. Currently we allow the author to hold the copyright, if
they ask. Otherwise we don't put a copyright on the individual paper.
> Budget for honoraria for AI Mag solicited articles -- in particular, for
surveys.
> Conf. Proc. copyrights. Currently nothing is being done here.
> Conf. Proc. abstracting and reprint service. We've been approached by a
service (EIC/Intelligence) that wants to print abstracts and supply reprints
of papers from our conference proceedings. We would get 10% of the gross
sales. We would need to gain copyright control of all the papers. Such an
arrangement would likely interact with our arrangement with Kaufman.
> New publications?
> The publication committee itself. I and we have done very little. Is
there more that needs to be done? If yes, how?
Feel free to comment beforehand on any of these items, as well as to suggest
other items.
looking forward to seeing you all soon,
Lee
-------
∂13-Jul-84 0801 HST lisp history
Hi john!
In Marvins house we found a copy of the first LISP manual (March 1959).
The only problem is - it's not complete.The parts concerning apply are missing.
But it's pretty shure now that there really were 10 versions of descriptions
of the apply-function.
Today I met P.Morse.He does not remember much.But he showed me semi-annual
progress reports which contained ai-reports even before september 58.
Another thing occurred me if I saw a paper of Kemeny concerning nonumerical
computeation work done at Dartmouth. - I neglected so far influences
from dartmouth.If work in those direction was done in Dartmouth - don't you
think you got stimulated by Kemeny and Kurtz in the direction of LISP?
Marvin showed me a paper containing hints on character recognition you gave IBM
in summer 1957.Morse said you must have spend time at MIT already at the
end of 1956.
Another topic.You know that they made a great 25 anniversary with Fortran
(the history of computation guys)?Therefore we should face a 30 anniversary
(is that the right word at all?)for LISP in 88.That's in 4 years.They had
big photographs,collected all peoplle together,made big sentences and the like.
David Park was here and showed me the old rooms in Building 26.
Enough - I arrive next Saturday.
Herbert
∂13-Jul-84 0926 GROSOF@SU-SCORE.ARPA Re: bibliography
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jul 84 09:26:51 PDT
Date: Fri 13 Jul 84 09:25:46-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: Re: bibliography
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 4 Jul 84 00:40:00-PDT
Hi John,
Yes, but not right away.
Benjamin
-------
∂13-Jul-84 0932 DEK chapiro's committee
John, there was a lack of understanding / lack of communication
in this somewhat unusual case. Namely, he is a CS student, but
his committee only includes two representatives of CS: Baskett
(consulting prof) and Trabb Pardo (alumnus). The others on his
committee are EE assistant professors (Mathews and Newkirk)
who have mostly left Stanford although they retain assistant
prof rank.
Thus, it looked like a Stanford oral exam was being entirely
conducted by people who are almost entirely full time in industry.
The thought is that it would be nice if somebody who is really
at Stanford would at least sit in to watch!
With this background, I'm not sure you would still agree that
it is better for all of us regulars to leave so that we can
get some work done. At least, that postulate has lots of
other corollaries with respect to whether university faculty
should care at all about educational matters and quality control
of the degrees being awarded.
∂13-Jul-84 1047 HST kemeny
the paper i have here is:"Symbolic Computation with the 704 computer"
written by kemeny in september 1956 during a visit at rand.it contains
a description of a program which checked formulas in the propositional
calculus by computing truth-tables.
The manual is written by you (3/3/59).Fox wrote the LISP1-manual.
∂13-Jul-84 1424 HEDRICK@RUTGERS.ARPA Re: Your Common Lisp
Received: from RUTGERS.ARPA by SU-AI.ARPA with TCP; 13 Jul 84 14:23:59 PDT
Date: 13 Jul 84 17:19:08 EDT
From: Charles Hedrick <HEDRICK@RUTGERS.ARPA>
Subject: Re: Your Common Lisp
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of 13 Jul 84 15:18:00 EDT
There is no question that it will use more CPU time than it would
if there were a compiler. We have used ELISP in courses, with no
problem. The underlying system is the same. Howver ELISP has a
compiler, and the system code is compiled. Our actual target for
production use is January. I will be happy to fix bugs. If something
is critical, I should be able to get to it quickly. However there
is no question that it will be a bit slow. You should look at the
user interface and see whether it has enough of what you expect in
a Lisp to satisfy your students. I will probably do a few tweaks
before September, but you shouldn't expect much improvement. If there
is something particular that you need by then, please tell me and I
will try to do it. The only thing I can't do is guarantee a compiler
or compiled code by September.
-------
∂13-Jul-84 1704 BSCOTT@SU-SCORE.ARPA Beth Moore
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Jul 84 17:04:14 PDT
Date: Fri 13 Jul 84 16:59:46-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Beth Moore
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I haven't had a chance to check references, but are you at all interested
in Beth Moore as your secretary?
Betty
-------
∂14-Jul-84 1247 IAM
good i'll take a peak at it.
∂14-Jul-84 1342 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Jul 84 13:41:54 PDT
Date: Sat 14 Jul 84 13:41:12-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 13 Jul 84 17:44:00-PDT
I will check on the too talkative issue, and also about her reasons for
leaving other jobs. She says "Reorganization" several times, and I'm always
a little apprehensive about this. Will let you know what I find out.
Betty
-------
∂14-Jul-84 1628 IAM
the introduction to proving is finished and is in iantst.tex[b2,jmc]
∂15-Jul-84 1412 WIEDERHOLD@SRI-AI.ARPA sail chars.
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 15 Jul 84 14:11:55 PDT
Date: Sun 15 Jul 84 14:13:17-PDT
From: Gio <Wiederhold@SRI-AI.ARPA>
Subject: sail chars.
To: ark@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
Unfortunatly not all SAIL characters exist in the default set.
But the characterset image for the symbols beyond 127 dec. 7F hex, 177 oct.
can be changed by software in the PC; there have been programs published.
The already matching set, with suggestions for a quicky solution is
given below. But setting the nismatches should take little time for a hacker.
Some decisions must be made to assure distinctiveness. I'd ask Johnny, but
he has already too many jobs. If they are changed it works for both the
printer and the display!
Gio
here goes:
--------------------------------------------------------------------------
IBM PC character definitions versus SAIL ASCII characters.
Gio Wiederhold, Arhur Keller July 15 1984
note that all matching characters are also available on the screen,
so that the matching set can also be put on a display.
PC ASCII SAIL name(description) [PC description if different]
Dec. HEx
249 F9 000 nul (prints as centered bullet)
025 19 001 downarrow
224 E0 002 alpha
225 E1 003 beta
na 004 and [kludge: use 166 A6 l.c. a underbar from swedish ?]
169 A9 005 not symbol (upper right hand corner of box)
238 EE 006 epsiln
227 E3 007 pi
na 010 lambda [kludges: use 159 9F script f, meant for function,
or 156 9C British Pound symbol]
226 E2 011 tab (prints as gamma) [Capital Gamma]
229 E5 012 lf (prints as delta) [lc delta, but see below SAIL 017]
244/245 013 vt (prints as integral sign) [top and bottom halves distinct]
F4/F5 [ or use 159 9F script f, meant for function]
241 F1 014 ff (prints as plus/minus)
na 015 cr (prints as circle/plus) [two characters or kludge:
use 233 EA Theta]
236 EC 016 infinity
229 E5 017 partial (as in partial derivative) [see above SAIL 012]
na 020 subset (open horseshoe) [square shape can be built from plotting
symbols, or kludge: use 204 CC ||= joined]
na 021 superset (close horseshoe) [square shape can be built from
plotting symbols, or kludge: use 181 B5 =| joined]
239 EF 022 intersect [Set symbol]
na 023 union [undistinguishable from Capital U,
or use 154 9A U Umlaut]
na 024 for all [kludge: use 142 8E A with umlaut ]
na 025 there exists [kludge: use 144 90 E with umlaut, or
can be built from plotting symbols]
237 ED 026 circle-X (railroad crossing) [circle-slash]
018 12 027 double arrow, left right [up down ! arrow]
095 5F 030 underscore [in base set]
026 1A 031 right arrow
126 7E 032 tilde [in base set]
216 D8 033 not equal [plotting symbol: horiz. double line x vert. sin.line]
243 F3 034 less than or equal
242 F2 035 greater than or equal
240 F0 036 triple equal
na 037 or symbol [kludge: use 167 A7 l.c. o underbar from swedish ?]
032 20 040 space
033 21 041-057 ASCII symbols
048 30 060-071 digits
058 3A 072 :
etc 073 ;
074 <
075 =
076 >
077 ?
100 @
101-132 upper case alphabet
133 [
134 \
093 5D 135 ]
024 1A 136 up arrow (not caret)
027 1B 137 left arrow (not underscore)
096 60 140 ` (left quote)
097 61 141-172 lower case alphabet
123 7B 173 {
124 7C 174 vertical bar
004 04 175 alt (this is what ASCII calls ESC) (prints as a diamond)
[solid diamond from card set]
125 7D 176 }
094 5E 177 bs (what ASCII calls DEL) (prints as caret)
Other intersting characters:
001 01 light smiley face
002 02 dark smiley face
015 0F sun, circle with 8 rays
016 10 left solid arrow head
017 11 right solid arrow head
168 A8 upside question mark from spanish
174 AE << much less
175 AF >> much greater
228 E4 cap. Sigma
229 E5 l.c. sigma
230 E6 l.c. mu
231 E7 cap. Tau
232 E8 cap. Phi
233 E9 l.c. omega
234 EA cap. Omega
246 F6 -: div
247 F7 approx., double tilde
248 F8 degree
251 FB square root
252 FC superscript n
253 FD superscript 2
-------
∂15-Jul-84 1529 GROSOF@SU-SCORE.ARPA default reasoning as circumscription
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jul 84 15:29:42 PDT
Date: Sun 15 Jul 84 15:29:01-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: default reasoning as circumscription
To: jmc@SU-AI.ARPA, genesereth@SUMEX-AIM.ARPA
My abstract has been accepted for the Nonmonotonic Reasoning Workshop in
October. The referees' comments were quite positive.
Benjamin
-------
∂15-Jul-84 1738 GROSOF@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Jul 84 17:37:54 PDT
Date: Sun 15 Jul 84 17:37:16-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 15 Jul 84 17:34:00-PDT
I got the letter a few days ago.
Benjamin
-------
∂16-Jul-84 0851 BERG@SU-SCORE.ARPA textbooks
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Jul 84 08:51:15 PDT
Date: Mon 16 Jul 84 08:50:33-PDT
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: textbooks
To: jmc@SU-AI.ARPA
cc: berg@SU-SCORE.ARPA
Stanford-Phone: (415) 497-4776
I have not yet received your textbook order for autumn quarter.
Please let me know the title, author and number of copies of
the text you will be using for CS 206 at your earliest convenience.
Thank you
Kathryn Berg
-------
For CS206 I will be using the McCarthy and Talcott book draft which will
be ready only in September and the Common Lisp Reference Manual by Guy
Steele published by Digital Press. Please order 50 of the Common Lisp
Manual.
∂16-Jul-84 0929 DFH
To: JMC, DFH
Gregory Katz called re your interest in a TA for CS206. His telephone is
857-9013 and machine address is G.GRKTZ@ LotsA
∂16-Jul-84 0931 vardi@diablo re: "The Fifth Generation" (from SAIL's BBOARD)
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 16 Jul 84 09:31:28 PDT
Date: Mon, 16 Jul 84 09:25:36 pdt
From: Moshe Vardi <vardi@diablo>
Subject: re: "The Fifth Generation" (from SAIL's BBOARD)
To: JMC@Sail
Another quote: "There is barely a pause for thought about the social
earthquakes that will follow when AI emerges from Mr. Feigenbaum's laboratory.
The main concern appears to be whether it will remake society in the image of
California or of Tokyo, not whether society might prefer to have other ideas."
∂16-Jul-84 0953 AAAI-OFFICE@SUMEX-AIM.ARPA SCRIPT
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 Jul 84 09:53:18 PDT
Date: Mon 16 Jul 84 09:52:50-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: SCRIPT
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
JOHN,
Here is a draft script for presentation of Dr. Gerry Fonken and
Don Walker to the conference attendees on Thursday, Aug 9.
Also, did Ron tell you that you will need to present the
winners of the Publisher's Prize Awards on Tuesday
afternoon?
Claudia
[SEND TO JMC, NILS. DON]
This is a schedule of events prior to the Presidential Address.
It notes the time, the speaker and text.
TIME TOPIC/SPEAKER
---------------------------------------------------------------
10:50 a.m. INTRODUCTION OF DR. GERHARD FONKEN,
VICE PRESIDENT OF ACADEMIC AFFAIRS AND
RESEARCH
by
John McCarthy
JMC- "THE AAAI APPRECIATES AND THANKS THE GRACIOUSNESS AND HOSPITALITY
OF THE UNIVERSITY OF TEXAS IN SHARING ITS FACILITIES FOR OUR CONFERENCE.
THE EFFORTS OF PARTICULAR INDIVIDUALS, NAMELY DRS. AUSTIN GLEASON, WOODY
BLEDSOE, ELAINE RICH, GORDON NOVAK AND GERHARD FONKEN AND MR. STEVE PARKS
WHO HAVE DIRECTLY CONTRIBUTED TO THE OPERATION OF THE CONFERENCE
ARE ESPECIALLY ACKNOWLEDGED.
AT THIS TIME, I'D LIKE TO INTRODUCE DR. GERHARD (GERRY) FONKEN
WHO WOULD LIKE TO WELCOME THIS YEAR'S CONFERENCE ATTENDEES TO
THE UNIVERSITY OF TEXAS CAMPUS."
10:50 - 11:00 A.M. WELCOMING ADDRESS BY DR. GERHARD FONKEN
11:00 - 11:05 A.M. PRESENTATION OF THE CERTIFICATE OF
RECOGNITION TO DR. DON WALKER
by
John McCarthy
JMC- "THE AAAI WOULD LIKE TO THANK DON WALKER FOR THE YEARS OF SERVICE TO
THIS ORGANIZATION AS SECRETARY-TREASURER. AS SECRETARY-TREASURER,
DON WAS INSTRUMENTAL IN DEVELOPING THE ADMINISTRATIVE FOUNDATIONS
OF THE AAAI, ESPECIALLY ASSISTING WITH THE ORGANIZATION OF THE FIRST
CONFERENCE AND SUBSEQUENT CONFERENCES, THE DEVELOPMENT OF ACCOUNTING
AND GENERAL OFFICE, AND ACTING ON NUMEROUS OCCASIONS AS OUR
"CORPORATE MEMORY."
DON FREELY GIVES HIS TIME IN SUPPORT OF THIS
ORGANIZATION AS WELL AS OTHERS, SUCH AS THE ASSOCIATION
FOR COMPUTING MACHINERY AND THE INTERNATIONAL JOINT
CONFERENCES ON ARTIFICIAL INTELLIGENCE. DON REPRESENTS
THE TRUE SENSE OF VOLUNTEERISM.
[ John hands the certificate to Don]
THE AAAI SINCERELY APPRECIATES YOUR VOLUNTEER EFFORTS OVER
THE YEARS AND PRESENTS TO YOU A CERTIFICATE OF RECOGNITION.
DON, WOULD YOU LIKE TO SAY TO A FEW WORDS...."
11:00 - 11:02 DON WALKER
11:02 - 11:06 INTRODUCTION OF JOHN MCCARTHY
by
NILS NILSSON, FORMER PRESIDENT OF THE AAAI
11:06 A.M. - 12:15 P.M. PRESIDENTIAL ADDRESS
by
John McCarthy
-------
∂16-Jul-84 1122 DFH
To: JMC, DFH
Dick Sherman of Ford Aerospace in PA called. Wishes to speak to you
about potential DARPA contract. 415 852 4122.
∂16-Jul-84 1150 BERG@SU-SCORE.ARPA text (again)
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 16 Jul 84 11:50:05 PDT
Date: Mon 16 Jul 84 11:49:08-PDT
From: Kathy Berg <BERG@SU-SCORE.ARPA>
Subject: text (again)
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4776
I neglected to ask you if the text was required or optional.
thanks,
Kathy
-------
∂16-Jul-84 1414 HOBBS@SRI-AI.ARPA General meeting this week
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Jul 84 14:14:29 PDT
Date: Mon 16 Jul 84 14:16:14-PDT
From: HOBBS@SRI-AI.ARPA
Subject: General meeting this week
To: commonsense.people: ;
There will be a general meeting again this week of the commonsense summer
people. 10 am on Wednesday, usual place EK242 at SRI. Phil Cohen will
talk and lead a discussion on formalizing speech acts.
-- Jerry
-------
∂17-Jul-84 0710 HST a permission
hi john.gloria organized a contact with Roland Silvers former wife.She's saved
many pictures (we will see).She's willing to show them and lets me copy
them only if you will permit.Do you have any objections?
Herbert
∂17-Jul-84 0909 HART@SRI-AI.ARPA AAAI Exec. Comm. Agenda
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Jul 84 09:09:26 PDT
Date: Tue 17 Jul 84 09:11:26-PDT
From: HART@SRI-AI.ARPA
Subject: AAAI Exec. Comm. Agenda
To: jmc@SU-AI.ARPA
cc: hart@SRI-AI.ARPA
John,
I have two proposals-- in straw-man form-- for the Executive
Council to consider. The first, regarding an "AI Hilbert-List",
you've already seen. Response to this proposal has been generally
favorable, but not overwhelmingly enthusiastic.
My second proposal is of quite a different nature. Concern
about the often-inferior media coverage of AI has prompted me to look
into the possibility of underwriting news coverage of AI on National
Public Radio. (If you're a regular listener of KQED-FM, you may know
their morning and evening "magazine format" programs: Morning Edition
and All Things Considered. These programs are generally high-quality,
in-depth reports that include science, art and literature coverage in
addition to the usual political and international coverage.) I've
had some conversations with the NPR people from Washington about what
the alternatives and costs might be. With luck, they may be able to
respond with at least a preliminary proposal to us by the time of the
meeting, in which case we'll have something very specific to discuss.
I've surfaced this idea to some of the other people to see if
there was any potential interest, and have gotten a surprisingly strong
response. Thus, even if we have no further word from NPR, I think we
should take time to discuss the possibility. (Genesereth, for example,
would like to go further and see if we could afford to underwrite a
NOVA program.) I'll circulate a short write-up containing whatever
information we do have about the alternatives before AAAI time.
Peter
-------
∂17-Jul-84 1434 DFH
To: JMC, DFH
Sophie at Ala Carte says they do have the cider.
∂17-Jul-84 1436 JK 3600 EKL
To get started, type (load ">JK>EKL>EKL-SYSTEM").
Use SYMBOL-HELP to find out about special symbols.
The file >JK>EKL>EKL.HOWTO contains the rest of the story.
All the files are at Coax.
∂17-Jul-84 1520 JK
Here is the way to formulate the stuff in EKL:
Create a new operation, TUPLEAPPLY with the following properties:
TUPLEAPPLY(() x) =()
TUPLEAPPLY((f s) x)= ((f x) (TUPLEAPPLY s x))
Then (f(x,y),g(y,z))=TUPLEAPPLY((f⊗(π1,π2),g⊗(π2,π3)),(x,y,z))
∂17-Jul-84 1556 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - July 20, l984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Jul 84 15:56:23 PDT
Date: Tue 17 Jul 84 15:52:29-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - July 20, l984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, July 20, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Bill Clancey
Heuristic Programming Project
Stanford University
TOPIC: Classification Problem Solving
ABSTRACT:
A broad range of heuristic programs--embracing forms of
diagnosis, catalog selection, and skeletal planning--accomplish a kind
of well-structured problem solving called classification. These
programs have a characteristic inference structure that systematically
relates data to a pre-enumerated set of solutions by abstraction,
heuristic association, and refinement. This level of description
specifies the knowledge needed to solve a problem, independent of its
representation in a particular computer language. The classification
problem-solving model provides a useful framework for recognizing and
representing similar problems, for designing representation tools, and
for understanding the problem-solving methods used by
non-classification programs.
-------
∂17-Jul-84 1751 BSCOTT@SU-SCORE.ARPA Rutie Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jul 84 17:50:54 PDT
Date: Tue 17 Jul 84 17:50:08-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rutie Adler
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
This person is coming in tomorrow morning for an interview at 8:30. Zohar,
I believe she is the secretary you mentioned as being possibly interested
in your job.
Betty
-------
∂17-Jul-84 1805 BSCOTT@SU-SCORE.ARPA Re: Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Jul 84 18:04:59 PDT
Date: Tue 17 Jul 84 18:04:12-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Adler
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 17 Jul 84 17:52:00-PDT
O.K., John. Will call you if she's a possible candidate.
Should tell you that I did some checking on Beth Moore. Her skills are
apparently quite good, but she is not able to function in an "unstructured"
atmosphere and so is being terminated in her current job. I don't think
she would fit here either, for the same reason. She apparently gets quite
upset if she's asked to do something when she is in the middle of doing
something else. Flexibility is important in any secretarial position, and
I consider it quite important here.
Betty
-------
∂17-Jul-84 2301 vardi@diablo Mailing List
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Jul 84 23:01:07 PDT
Date: Tue, 17 Jul 84 23:01:03 pdt
From: Moshe Vardi <vardi@diablo>
Subject: Mailing List
To: jmc@sail, levesque@sri-kl
Cc: fagin.ibm-sj@udel-relay, halpern.ibm-sj@udel-relay
The paper by Fagin, Halpern, and myself is going to appear in the IEEE
Symp. on the Foundations of Computer Science. As this conference is not
widely attended by AI people, we would like to send copies of the paper
to people in the AI community. Do you have a mailing list that we can
use? None of us is too familar with the AI community.
Thanks,
Moshe
∂18-Jul-84 0838 HART@SRI-AI.ARPA Re: aaai exec-com agenda
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 08:38:24 PDT
Date: Wed 18 Jul 84 08:40:20-PDT
From: HART@SRI-AI.ARPA
Subject: Re: aaai exec-com agenda
To: JMC@SU-AI.ARPA
cc: hart@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 17 Jul 84 10:02:00-PDT
Good comments...
The Hilbert-list may indeed be a bad idea; Nilsson seems to prefer
awarding after-the-fact prizes on an infrequent basis (perhaps
biannually), for work that hindsight has shown to be seminal. In other
words, an AI Nobel prize for scientific contributions, rather than for
"look, Ma, no hands".
The NPR idea I think is perhaps more promising. A grant there could
support some fractional or whole journalistic bodies for a period of
a year, during which they would accumulate in-depth understanding
(on the journalistic scale of things) about AI. The program segments
produced would presumably reflect this. We would, of course, have no
editorial control, nor should we wish any. I think the straight "AI
story" is a fine one as is, and have no problem with the appearance of
an occasional bit on the Weizenbaums of the world.
I've mentioned this idea to Woody; he appears enthusiastic, but thinks
it might belong on your agenda rather than his. Whatever you work out with
him is fine with me.
-------
∂18-Jul-84 0900 JMC*
call about will
∂18-Jul-84 0941 DFH
To: JMC, DFH
You can go to Washington, D.C. non-stop at 8:40 am or 2 pm on July 23.
All other flights in between and after stop, some requiring change of
plane. Bolla is holding your ticket until I let her know which flight
you prefer. The 2 pm flight arrives at 9:50 pm.
∂18-Jul-84 0952 DFH
To: JMC, DFH
Dr. Huang of Comtex Scientific called at the suggestion of Richard
Fikes. She will call back but her numbers are 212 838 7200 till l:30
our time, and 202 487 1630 after.
∂18-Jul-84 0953 vardi@diablo Conference
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 09:53:39 PDT
Date: Wed, 18 Jul 84 09:53:50 pdt
From: Moshe Vardi <vardi@diablo>
Subject: Conference
To: JMC@Sail, vardi@SU-AIMVAX.ARPA
Cc: levesque@SRI-AI.ARPA
Indeed, Joe Halpern is planning on having a conference in about 2 years.
Moshe
∂18-Jul-84 0925 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 09:11:42 PDT
Date: Wed 18 Jul 84 09:13:27-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: commonsense.people: ;
There will be a general meeting of commonsense summer this morning at 10
in EK242. Phil Cohen will talk and lead a discussion about formalizing
speech acts.
-- Jerry
-------
∂18-Jul-84 0934 SPURGEON@SU-CSLI.ARPA re: nuclear targeting (from SAIL's BBOARD)
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 09:34:05 PDT
Date: Wed 18 Jul 84 09:33:56-PDT
From: Bud Spurgeon <SPURGEON@SU-CSLI.ARPA>
Subject: re: nuclear targeting (from SAIL's BBOARD)
To: JMC@SU-AI.ARPA
cc: OTHER-SU-BBOARDS@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 17 Jul 84 21:52:00-PDT
I'd feel better knowing that the Russian nuclear targeting and
control computers were the best money could buy. Forcing them to
use antiquated or less reliable equipment to control the weapons
aimed in our direction doesn't impress me as sound policy...
-Bud
-------
∂18-Jul-84 0959 DFH
To: JMC, DFH
A Mr. Eckroth of J. Wiley, NY, called. He is manager of a new Encyclopedia
of AI which they are starting with Stuart Shapiro as editor. He wants you
to contribute some articles. He will call back later this afternoon.
∂18-Jul-84 1047 TREITEL@SUMEX-AIM.ARPA re: nuclear targeting (from SAIL's BBOARD)
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 10:47:05 PDT
Date: Wed 18 Jul 84 10:45:45-PDT
From: Richard Treitel <TREITEL@SUMEX-AIM.ARPA>
Subject: re: nuclear targeting (from SAIL's BBOARD)
To: SPURGEON@SU-CSLI.ARPA
cc: JMC@SU-AI.ARPA, OTHER-SU-BBOARDS@SU-AI.ARPA, treitel@SUMEX-AIM.ARPA
In-Reply-To: Message from "Bud Spurgeon <SPURGEON@SU-CSLI.ARPA>" of Wed 18 Jul 84 09:34:47-PDT
So it is probably a good idea to let the Russians buy Apples anyway. Besides,
one article I read recently encouraged us to think of what a few Apples or
other PCs, connected by even the Russian telephone network, could do for the
samizdat industry.
Possibly we should encourage Apple to refuse to sell anything to the Russians
unless a printer is thrown in.
- Richard {:-)
-------
∂18-Jul-84 1116 DFH
To: JMC, DFH
Ticket to LA on Thursday is in Current Events file.
∂18-Jul-84 1132 BSCOTT@SU-SCORE.ARPA Rutie Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Jul 84 11:32:32 PDT
Date: Wed 18 Jul 84 11:30:19-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rutie Adler
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, an appointment for you to talk with Rutie Adler at 5:15 Friday afternoon
has been confirmed.
Zohar, let me know if you also want to talk further with her.
Betty
-------
∂18-Jul-84 1254 IAM
To: JMC, IAM, RTC, CLT
Outline of the proposed contents to chapter three, the new proving chapter
section one: general introduction and motivation.
section two: basic introduction to logic, over a fixed multisorted algebra.
section three: introduction of bottom to allow program definitions to be
used as charecterizations
section four: specification of the extended sexp domain, and the equations
that are fundamental.
section five: simple examples to be used as a template for students proofs
section six: pattern matching.
∂18-Jul-84 1949 RWW SATO
To: JMC, CLT
HE IS HERE. HE IS STAYING AT MY HOUSE. WE HAVE BEEN
LOOKING FOR AN APARTMENT. I THOUGHT HE HAD CONTACTED YOU
BEFORE BUT THAT DOESNT SEEM SO. ANYWAY I WILL BRING HIM TO
THE DEPT TOMORROW. ALSO HE NEEDS TO BUY A CAR.
ANY IDEAS?
RICHARD
∂19-Jul-84 0606 ATP.BLEDSOE@UTEXAS-20.ARPA Re: aaai exec-com agenda
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 19 Jul 84 06:06:33 PDT
Date: Thu 19 Jul 84 08:06:52-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: aaai exec-com agenda
To: JMC@SU-AI.ARPA, hart@SRI-AI.ARPA, aaai-office@SUMEX-AIM.ARPA,
bledsoe@UTEXAS-20.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 17 Jul 84 10:02:00-CDT
I would be willing for these to be discussed in my part of the meeting -
in which case just pass them over John and I will pick them up - but
I feel no expertise in either area.
Woody
-------
∂19-Jul-84 0703 HST lisp history etc.
I met Tim Hart and Tom Evans yesterday and they give their best regards to
you.They told me that you had told them that to push something into Algol
(recursion?,conditional expressions?)you proposed some very strange thing
(own-variables?)to have something for bargaining.Do you remember?
The Fotos of Mary proved to be not as important as she made it before.
I got 2 nice pictures of Roland and 2 of you - but nothing from Dartmouth
as she said.Herbert
∂19-Jul-84 0844 HST visit
john,I have overlooked the fact that my flight is already on friday,that is
tomorrow.I try to shift it to saturday but it semms not to work.Would it
make trouble at the faculty club if I arrive tomorrow?Herbert
∂19-Jul-84 1517 DFH
To: JMC, DFH
Your ticket to Washington and New York is in current file.
∂19-Jul-84 1518 HST visit
john, this overwrites my last messages.Because i found no access to you
and here is still something to be done I changed my fly to monday (I could'nt
change to saturday).I gave a talk on LISP-history today and it seems to
have made its way.Are you interested that I do that in Stanford?
∂19-Jul-84 1610 GLB
Carolyn suggests that you might be interested in TAing CS206. Are you?
I am certainly interested in it. Thank you for considering me. For which
quarter(s) do you need TAing?
∂20-Jul-84 0706 @COLUMBIA-20.ARPA:US.TRAVIS@CU20B Re: SMP
Received: from COLUMBIA-20.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 07:06:29 PDT
Received: from CU20B by CUCS20 with DECnet; 20 Jul 84 10:06:56 EDT
Date: Fri 20 Jul 84 10:06:30-EDT
From: Travis Lee Winfrey <Us.Travis%CU20B@COLUMBIA-20.ARPA>
Subject: Re: SMP
To: JMC%SU-AI@COLUMBIA-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 19 Jul 84 20:50:00-EDT
Thanks. Have you ever used it? Do you know what it's like?
Travis
-------
∂20-Jul-84 0831 AAAI-OFFICE@SUMEX-AIM.ARPA parking permit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 08:31:22 PDT
Date: Fri 20 Jul 84 08:29:32-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: parking permit
To: rich@UTEXAS-20.ARPA
cc: aaai-office@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Elaine,
Can you tell John and I where to pick up the permits on the UT campus?
I'll be entering from 26th Street by RLMoore Hall.
Thanks,
Claudia
-------
∂20-Jul-84 0915 minker@umcp-cs.arpa Math Year Schedule
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 09:15:18 PDT
Received: From umcp-cs.csnet by csnet-relay; 20 Jul 84 11:41 EDT
Date: 20 Jul 84 11:30:18 EDT (Fri)
From: JACK MINKER <minker@umcp-cs.arpa>
Subject: Math Year Schedule
To: decvax!watmath!mhvanemden@ucb-vax.arpa, Reiter%ubc.csnet@csnet-relay.arpa,
JMC@su-ai.arpa, henschen@anl-mcs.arpa,
Barwise%su-csli.arpa@csnet-relay.csnet
Cc: perlis@umcp-cs.arpa, egkle@umcp-cs.arpa
Dear Jon, Larry, John, Ray, and Maarten,
Thank you for sending me the titles of your lectures
for the Math Year Week devoted to Logic and its Role in
Artificial Intelligence. Some of you were happy with the
schedule of only one talk per person and some preferred the
two talk schedule. We have compromised and are extending the
lecture time from one hour to one and one half hours. Thus,
you can combine two talks if you so desire. The lectures
will start at 10AM and we can then have the afternoons for
informal discussions as I had suggested in my previous mes-
sage to you.
The following are the lecture titles and dates that we
will follow. If this is not convenient for you, we can read-
just the date within some constraint. John McCarthy has to
leave for Europe on Wednesday. Hence, his lecture should be
a fixed point on Tuesday as I have given it below.
Logic and its Role in Artificial Intelligence
Monday Ray Reiter
Logic for Specification: Databases, Conceptual Models
and Knowledge Representation Languages
Tuesday John McCarthy
The Mathematics of Circumscription
Wednesday Jon Barwise
Constraint Logic
Thursday Maarten Van Emden
Strict and Lax Interpretation of Rules in
Logic Programming
Friday Larry Henschen
Compiling Constraint Checking Programs
in Deductive Databases
Please let me know if the title of your lecture is
accurate and if the date for your talk is acceptable.
Assuming that everything is satisfactory, please send me a
short abstract of your lecture. We will need the abstract
for publicity. To facilitate paying you your honorarium, I
will need the social security number of our U.S. lecturers,
and other identifying number for our Canadian lecturers.
Please send me this information together with your abstract.
Enclosed for your information is the abstract for
Maarten's lecture.
Strict and Lax Interpretations of Rules in Logic Programming
by
Maarten Van Emden
The strict interpretation says only that is admitted
which is explicitly allowed by a rule. The lax interpreta-
tion says only that is excluded which is explicitly disal-
lowed. This distinction is important in mathematics and in
law, for example. Logic programs also are susceptible to
both inter- pretations. We discuss the use of fixpoint tech-
niques to determine Herbrand models of logic programs. We
find that least fixpoints and least models correspond to the
strict interpretation and characterize successful finite
computations of logic programs. Greatest fixpoints and
greatest models correspond to the lax interpretation and are
closely related to negations inferred by finite failure and
to terms constructed by certain infinite computations.
∂20-Jul-84 0927 @COLUMBIA-20.ARPA:US.TRAVIS@CU20B Re: smp
Received: from COLUMBIA-20.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 09:26:51 PDT
Received: from CU20B by CUCS20 with DECnet; 20 Jul 84 12:27:17 EDT
Date: Fri 20 Jul 84 12:26:58-EDT
From: Travis Lee Winfrey <Us.Travis%CU20B@COLUMBIA-20.ARPA>
Subject: Re: smp
To: JMC%SU-AI@COLUMBIA-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 20 Jul 84 09:18:00-EDT
Ok... Thanks for the information.
Travis
-------
∂20-Jul-84 1205 ZM
To: JMC, DFH
Sarah calledto remind you to call the Hertzenbergs.
∂20-Jul-84 1240 PACK@SU-SCORE.ARPA Dynamic logic
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 12:40:33 PDT
Date: Fri 20 Jul 84 12:39:12-PDT
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
Subject: Dynamic logic
To: jmc@SU-AI.ARPA
What is dynamic logic? Can you point me to any papers, etc? I keep
hearing it mentioned, and noticed you had a rather strong reaction to
it when someone mentioned it in the common sense talk.
-Leslie
-------
Dynamic logic is Vaughan Pratt's and David Harel's idea. A specific paper
doesn't come to mind. You can call Vaughan at Sun Microsystems or look in
the library. My negative reaction was related to my previous negative
opinion about it as a formalism for proving facts about programs. I am
somewhat more open-minded about its possible adaptability as an AI
formalism.
∂20-Jul-84 1326 BSCOTT@SU-SCORE.ARPA Rutie Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 13:26:39 PDT
Date: Fri 20 Jul 84 13:25:12-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rutie Adler
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Rutie Adler just called me, and it will not be possible for her to keep her
5:15 appointment today. She would like to reschedule it for 5:15 on Tuesday.
Is this o.k. with you?
You should know that I've learned that Rutie is Zohar's personal friend.
Maybe you want to talk with him about this?
Betty
-------
∂20-Jul-84 1401 CLT
a la carte 8pm
∂20-Jul-84 1457 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 14:57:39 PDT
Date: Fri 20 Jul 84 14:56:43-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 20 Jul 84 14:47:00-PDT
O.K., John. I'll get her resume to you. - Betty
-------
∂20-Jul-84 1753 HOBBS@SRI-AI.ARPA Target Problems
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 17:49:01 PDT
Date: Fri 20 Jul 84 17:49:23-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Target Problems
To: kube@SRI-AI.ARPA, blenko@SRI-AI.ARPA, croft@SRI-AI.ARPA, kells@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, rperrault@SRI-AI.ARPA, bmoore@SRI-AI.ARPA,
stan@SRI-AI.ARPA, konolige@SRI-AI.ARPA, appelt@SRI-AI.ARPA, jmc@SU-AI.ARPA,
levesque@SRI-KL.ARPA, nilsson@SRI-AI.ARPA
cc: hobbs@SRI-AI.ARPA
Here are some target problems for the psychosocial domain:
PSYCHOSOCIAL PROBLEMS
Board Game:
22 21 12 11
23 24 13 14
B
32 31 42 41
33 34 43 44
A
A can reach 1*, 4*
A can see 21, 12, 24, 13, 31, 42, 34, 43
B can reach 2*, 1*
B can see 23, 32, 24, 31, 13, 42, 14, 41
PROBLEMS:
1. Suspicious behavior:
Given: know(A, move(B,X,11,23,t1), t1)
(E t) know(A, know(B, goal(A,at(X,42,t), t1), t1), t1)
Prove: believe(B, -cooperative-with(B,A),t1)
2. Negotiation:
2a. Block R is at 42, block G is at 24. A wants G. B wants R.
A: "I'll give you R if you give me G first/afterwards."
[i.e. plan this utterance from A's goal and A's knowledge
of B's goal.]
2b. B: "Okay."
[plan this utterance or some suitable logical expression of it.]
A gives R to B. (in the "afterwards" case.)
2c. B gives G to R. (if in fact B does)
3. Mutual planning:
Block R1 is at 24, block R2 is at 43, block G is at 41.
Common goal is tower at 42 with red block on green block.
Players can start off with arbitrarily long conversation, with B's
turn first. They come to an agreement about the plan. Then
execute the plan without talking.
B: "G is at 41. I can move R1 to 13."
A: "I can already reach R2."
A and B now have common plan.
[Plan B's and A's utterances and show that they end up with a
common plan.]
-------
∂20-Jul-84 2111 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Jul 84 21:10:59 PDT
Date: Fri 20 Jul 84 21:10:19-PDT
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 20 Jul 84 14:50:00-PDT
I think the end of your message on dynamic logic got lost. Not really
important, anyway. I was just curious.
Do you have any new and interesting problems to think about?
-------
∂21-Jul-84 0842 JM01@CMU-CS-A.ARPA item for executive committee agenda
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 21 Jul 84 08:42:08 PDT
Date: 21 Jul 84 1139 EDT
From: John.McDermott@CMU-CS-A.ARPA (A312JM01)
To: jmc@SU-AI.ARPA
Subject: item for executive committee agenda
CC: aaai-office@SUMEX-AIM.ARPA
I'm giving two tutorials at AAAI this year and have just found out that my
compensation will be even more enormous than I had expected. I believe that
the executive committee should change its approach to compensating tutorial
givers; one change we might consider would be to put a lid on the maximum
amount that a tutorial giver could receive; it's probably fine for the maximum
to be somewhat generous as long as it's reality-based. John
∂21-Jul-84 1043 JM01@CMU-CS-A.ARPA
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 21 Jul 84 10:42:52 PDT
Date: 21 Jul 84 1334 EDT
From: John.McDermott@CMU-CS-A.ARPA (A312JM01)
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: "John McCarthy's message of 21 Jul 84 11:53-EST"
I don't know the formula, but the compensation is a percentage of the gate.
This year it's expected that 600 or 700 people will attend the two expert
systems tutorials. Evidently if that happens I'll get paid between $30,000
and $35,000. I'm giving each of the tutorials with somebody else (Lenat in
the morning and Genesereth in the afternoon), so I end up talking for about
4 hours. I probably spent 4 - 5 days preparing the tutorials (maybe double
that if you count the overhead-transparency base that I started from).
∂21-Jul-84 1356 PACK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Jul 84 13:53:46 PDT
Date: Sat 21 Jul 84 13:53:03-PDT
From: Leslie E. Pack <PACK@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 20 Jul 84 22:34:00-PDT
I don't really know what's going on with common sense summer. I
missed one of the meetings in which the students talked about what
they were working on -- that seems to be the main focus of what is
going on. I think I'd like to see more DISCUSSIONS of particular
problems in axiomatization, etc. I didn't get much out of Cohen's
talk. I'm curious to see what you (and others) decide the answer is
to "what is common sense".
Maybe we could talk next Friday if you have decided what common sense
is, or have interesting problems to discuss.
-------
∂22-Jul-84 0948 RPG Tomorrow
Do you have a plan for getting to the airport?
∂22-Jul-84 0958 RPG
∂22-Jul-84 0956 JMC
Sarah will drive me (us). My flight is UA58 at 2pm getting in at 9:50.
Are you on that now?
Yes, I am on that flight too. We might as well go together.
-rpg-
∂23-Jul-84 0900 JMC*
get money
∂23-Jul-84 0900 JMC*
RPG 746 Los Robles, 5th house on rt. past Ladonna.
∂23-Jul-84 1003 TOB sending greetings
John
I saw Bruce Bennett, math at UC Irvine, who sends
his greetings and best wishes.
∂23-Jul-84 1309 SIMONDS@CMU-CS-C.ARPA
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 23 Jul 84 13:08:44 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Mon 23 Jul 84 16:09:08-EDT
Date: Mon 23 Jul 84 16:09:01-EDT
From: Todd.Simonds@CMU-CS-C.ARPA
To: JMC@SU-AI.ARPA
cc: simonds@CMU-CS-C.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 22 Jul 84 17:48:00-EDT
John,
I am in Pittsburghright now, with a terminal with a bad space barand no delete key, so pardon the typing.
Just before I l;eft Paris, Mike and I agreed on a short-term compromise that
is more or less acceptable to JJSS. The compromise calls for hiring one of
his best thesis students to staff the project, rather than starting immediately
with two full-time staff members, and beginning work on the Robotics VAX, for
which Mike would build a terminal room in his lab. This would provide a base
for getting the work underway, with the continued expectation that the project
will get its own Vax and a full-time staff within six months., JJSS was not
willing a to assure a two-year contract for the thesis student, about which
Mike was rathdr insistent. The cost of building and equiping the terminal
room was within Mike's committed budget, hence can proceed immediately.
In the meantime, after diuscussion here with Raj, I have decided to leave
the Centre Mondial effective September 1. You are the first person
associated with the Centre who ids thus informed, but I'm telling you
know to the extent that it may affect your own plans for a return visit.
I remain optimistic that the Centre can be a good basin that is base for
launching interesteing projects, but I feel my own effectiveness is
limited to the point of, perhap[s, negative impact.
I will keep you current re the commitments to the library project; please
keep me informed of your plans.
-- Todd
-------
∂23-Jul-84 1341 BSCOTT@SU-SCORE.ARPA Secretary
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 23 Jul 84 13:41:30 PDT
Date: Mon 23 Jul 84 13:40:22-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Secretary
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
1. Appointment for 5:15 p.m., Friday, has been confirmed for Rutie Adler.
2. I made an appointment at 3:00 p.m., Friday, for Rebecca Johns, the other
applicant whose resume you returned to me.
Betty
-------
∂23-Jul-84 1828 AAAI-OFFICE@SUMEX-AIM.ARPA parking permit
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 23 Jul 84 18:28:36 PDT
Date: Mon 23 Jul 84 18:11:45-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: parking permit
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Did Elaine get to you about what entrance to pick-up the
parking permit yet? If not, pls tell me. Also, I'm leaving
on Sunday for Texas so if you want to discuss anything with
me, we should talk this week. Has the agenda been distributed
yet?
--- Claudia
-------
∂23-Jul-84 2218 Brachman@SRI-KL.ARPA Reminder about AAAI-84
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 23 Jul 84 22:18:00 PDT
Date: Mon 23 Jul 84 09:10:40-PDT
From: Ron Brachman <Brachman at SRI-KL>
Subject: Reminder about AAAI-84
To: deKleer at XEROX, Levesque at SRI-KL
cc: JMC at SU-AI
ReSent-date: Mon 23 Jul 84 11:24:37-PDT
ReSent-from: Ron Brachman <Brachman at SRI-KL at SU-DSN>
ReSent-to: dekleer at XEROX at SU-DSN, jmc at SU-AI
To the presenters at the special Publisher's Prize session at AAAI-84:
Please don't forget to prepare 35mm slides for your talks.
Also, I suggest we all meet in the Concert Hall Green Room about 3:20 on
Wednesday, August 8. That way we can make sure that Terry Ehling, the
lady from MIT Press who will be giving out the checks, knows who
everyone is, and that everything will go smoothly for the special
session.
By the way, the conference program has finally come back from the
printer - you can pick one up from the AAAI office if you would like (or
I can mail you a copy).
See you in Austin,
Ron
-------
∂24-Jul-84 1000 HOBBS@SRI-AI.ARPA Commonsense Summer Meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 24 Jul 84 10:00:47 PDT
Date: Tue 24 Jul 84 10:02:48-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Commonsense Summer Meeting
To: commonsense.people: ;
Another weekly meeting of Commonsense Summer. EK242, at 10am tomorrow (
Wednesday). We'll talk about progress in space, materials and such.
-- Jerry
-------
∂24-Jul-84 1048 DFH
To: JMC, DFH
Dick Thompson of TIME called and would like to speak with you this week
about an article in the magazine on AI. 415 982 5000.
∂24-Jul-84 1127 DFH
To: JMC, DFH
The computer museum in Boston called, wishing to know the date the film
on time-sharing that you gave them was made. Pls. call Carl Sprague
at 617 426 2800, X305.
∂24-Jul-84 1154 JAMIE@SU-CSLI.ARPA new secretary
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 24 Jul 84 11:54:46 PDT
Date: Tue 24 Jul 84 11:52:51-PDT
From: Jamie Marks <JAMIE@SU-CSLI.ARPA>
Subject: new secretary
To: etchemendy@SU-CSLI.ARPA, feferman@SU-CSLI.ARPA, ford@SU-CSLI.ARPA,
leben@SU-CSLI.ARPA, JMC@SU-AI.ARPA, Sag@SU-CSLI.ARPA, Wasow@SU-CSLI.ARPA,
Winograd@SU-CSLI.ARPA, Poser@SU-CSLI.ARPA, Bratman@SU-CSLI.ARPA,
Halvorsen@XEROX.ARPA, Pollard@SU-CSLI.ARPA, Shieber@SU-CSLI.ARPA,
Pullum@SU-CSLI.ARPA, Kaplan@XEROX.ARPA, RPerrault@SRI-AI.ARPA,
BMOORE@SRI-AI.ARPA, Stan@SRI-AI.ARPA, Goguen@SU-CSLI.ARPA,
Meseguer@SU-CSLI.ARPA, Pereira@SU-CSLI.ARPA, Uszkoreit@SU-CSLI.ARPA,
kay@XEROX.ARPA, nunberg@SU-CSLI.ARPA, bush@SRI-AI.ARPA, withgott@XEROX.ARPA,
appelt@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, hobbs@SRI-AI.ARPA,
konolige@SRI-AI.ARPA
cc: jamie@SU-CSLI.ARPA, trudy@SU-CSLI.ARPA
Trudy Vizmanos will be working as our new "trailer secretary" four
hours each day; the rest of her time she'll be helping us with expense
reports. She's sharing office E5 with Sandy. Please stop by and
introduce yourselves, and let Trudy know if she can help you in some
way. Please tell your office mates, in case I've forgotten to include
them.
Jamie
-------
∂24-Jul-84 1239 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, July 27, l984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Jul 84 12:39:31 PDT
Date: Tue 24 Jul 84 12:36:44-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, July 27, l984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, July 27, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Tom Dietterich
Heuristic Programming Project
Stanford University
TOPIC: Learning About Systems That Contain State Variables
ABSTRACT:
It is difficult to learn about systems that contain state variables
when those variables are not directly observable. This talk
formalizes this learning problem and presents a method called the
iterative extension method for solving it. In the iterative extension
method, the learner gradually constructs a partial theory of the
state-containing system. At each stage, the learner applies this
partial theory to interpret the I/O behavior of the system and obtain
additional constraints on the structure and values of its state
variables. These constraints can be applied to extend the partial
theory by hypothesizing additional internal state variables. The
improved theory can then be applied to interpret more complex I/O
behavior. This process continues until a theory of the entire system
is obtained. Several sufficient conditions for the success of this
method will be presented including (a) the observability and
decomposability of the state information in the system, (b) the
learnability of individual state transitions in the system, (c) the
ability of the learner to perform synthesis of straight-line programs
and conjunctive predicates from examples and (d) the ability of the
learner to perform theory-driven data interpretation. The method is
being implemented and applied to the problem of learning UNIX file
system commands by observing a tutorial interaction with UNIX.
-------
∂25-Jul-84 1031 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 25 Jul 84 10:31:42 PDT
Date: Wed 25 Jul 84 09:50:52-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: commonsense.people: ;
Commonsense Summer Meeting, 10 am, EK242. Today.
-- Jerry
-------
∂25-Jul-84 1110 DOYLE@CMU-CS-C.ARPA AI Magazine policy needed
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 25 Jul 84 11:10:28 PDT
Received: ID <DOYLE@CMU-CS-C.ARPA>; Wed 25 Jul 84 14:10:34-EDT
Date: Wed 25 Jul 84 14:10:30-EDT
From: Jon.Doyle@CMU-CS-C.ARPA
Subject: AI Magazine policy needed
To: McCarthy@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA, Engelmore@SUMEX-AIM.ARPA
cc: Carbonell@CMU-CS-C.ARPA, McDermott@CMU-CS-C.ARPA, Sleeman@SUMEX-AIM.ARPA,
doyle@CMU-CS-C.ARPA
Dear John, Woody, and Dr. Engelmore,
An unpleasant situation has arisen in the operation of AI Magazine,
and I would appreciate your help in correcting it.
AI Magazine recently published an article under my name.
Unfortunately, the article was not mine. My paper was read and
criticized by Jaime Carbonell, Derek Sleeman, and John McDermott, and
revised by me in accordance with their suggestions. Subsequently,
Claudia Mazzetti took it upon herself to rewrite the article, and her
version was printed without my knowledge or consent.
I take great pains in writing my papers, and so am happy to receive
suggestions of stylistic improvements and identifications of
typographical errors. But no scientific society I know of makes
changes in articles without the author's approval. The present case
is especially upsetting to me, for some of the changes were
substantial, not stylistic, made only to satisfy Ms. Mazzetti's
sensibilities. This is unacceptable behavior in a scientific society.
Authors do not need the ``protection'' from ``errors'' that Ms.
Mazzetti offers. The proper filters on papers are rejection and
conditional acceptance by scientific referees and editors, not
censorship by non-technical personnel.
I am sure that Ms. Mazzetti is doing a fine job aside from this
activity. AI Magazine now intends to offer authors galley proofs to
correct prior to publication. But I am not sure what this means. As
an author, and as a reader, I would greatly appreciate your making
clear a policy for AI Magazine proper to scientific publications:
namely, that authors have full responsibility for their own errors,
and that copy editors may suggest changes but not make them. If such
a policy is agreeable to you, could you please explain it to Ms.
Mazzetti?
Thank you for any assistance you can spare in this matter.
Sincerely yours,
Jon Doyle
-------
∂25-Jul-84 1340 BUCHANAN@SUMEX-AIM.ARPA AAAI Exec Comm. mtg
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Jul 84 13:40:50 PDT
Date: Wed 25 Jul 84 13:40:31-PDT
From: Bruce Buchanan <BUCHANAN@SUMEX-AIM.ARPA>
Subject: AAAI Exec Comm. mtg
To: jmc@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
John,
I will have a brief report on Membership Committee. I'd like
some discussion of current policies on (a) distributing the mailing
list and (b) providing services to members.
bgb
-------
∂26-Jul-84 0604 ATP.BLEDSOE@UTEXAS-20.ARPA Re: AI Magazine policy needed
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 26 Jul 84 06:04:21 PDT
Date: Thu 26 Jul 84 08:04:01-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: AI Magazine policy needed
To: Jon.Doyle@CMU-CS-C.ARPA, McCarthy@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA,
Engelmore@SUMEX-AIM.ARPA
cc: Carbonell@CMU-CS-C.ARPA, McDermott@CMU-CS-C.ARPA, Sleeman@SUMEX-AIM.ARPA,
doyle@CMU-CS-C.ARPA, ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "Jon.Doyle@CMU-CS-C.ARPA" of Thu 26 Jul 84 03:08:19-CDT
Jon,
I of course could not begin to address this problem until Claudia
has seen your message and had a chance to give her side of it.
Unless John has a better idea I would like to suggest the
following. Assuming that your charges are correct (and I certainly am not
saying that they are not) then I would like to ask Bob Englelmore
to investigate this incident and recommend policy that we might want
to discuss at the upcoming Publication Committee meeting at AAAI-84,
and possibly at the council meeting.
Also I will take the liberty of sending your message to Lee
Ermine.
Woody
-------
∂26-Jul-84 1612 ME authorizing accounts
To: MS
CC: JMC
∂26-Jul-84 1519 MS
Please assign my name, Masahiko Sato to this account, so that FINGER will
not say that I am UNKNOWN. Thank you.
ME - I can't do that unless someone (such as John McCarthy) authorizes
payment for the account through Lynn Gotelli.
∂26-Jul-84 1617 BSCOTT@SU-SCORE.ARPA Rebecca Johns
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Jul 84 16:17:34 PDT
Date: Thu 26 Jul 84 16:16:04-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rebecca Johns
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Cancel the 3:00 appointment tomorrow for Rebecca Johns. She has taken another
position.
As of now, the Rutie Adler appointment for tomorrow at 5:15 still stands.
Betty
-------
∂26-Jul-84 1803 HST visit
hi john.i believe the ituation without your secretary made it that the faculty
club never got a reservation order for me.i could get a room there only for 2
days and was thrown out yesterday.at present i sleep in hans uszkoreits hause
however he expects his furniture from germany every day and then i must leaave.
are you around here tomorrow?herbert
∂26-Jul-84 1940 YAW your social writings
John,
You may remember we had some correspondence over the net from Australia last year on this, and whether you might like them published in the Edinburgh Univ
Press AI series (plus a US publisher separately). Have you given any more thought to it. Id be happy to chat if youve any spare time. Im picking up mail here till Aug l6th and am at (408) 733 7142.
Best regards
Yorick Wilks
∂27-Jul-84 1333 AAAI-OFFICE@SUMEX-AIM.ARPA Execcom Agenda
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Jul 84 13:33:46 PDT
Date: Fri 27 Jul 84 13:29:04-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Execcom Agenda
To: Amarel@RUTGERS.ARPA, Bledsoe@UTEXAS-20.ARPA, Brachman@SRI-KL.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Engelmore@SUMEX-AIM.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Grosz@SRI-AI.ARPA,
Hart@SRI-AI.ARPA, Lenat@SU-SCORE.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Stan@SRI-AI.ARPA, GJS@MIT-MC.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Rich@MIT-MC.ARPA, McDermott@CMU-CS-A.ARPA
cc: JMC@SU-AI.ARPA, aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Below is the agenda for the executive council meeting.
John McCarthy
AGENDA
1984 AAAI EXECUTIVE COUNCIL MEETING
August 8, 1984
Concert Hall Green Room
7:00 p.m.
STAFF REPORTS
* Financial Reports - Richard Fikes
* Administrative - Claudia Mazzetti
COMMITTEE/PROGRAM REPORTS
* Election Results - Nils Nilsson
* 1984 Technical Program - Ron Brachman
* 1984 Tutorial Program - Doug Lenat
* Discussion of the Tutorial Speaker Fee Allocation -
John McDermott
* Discussion of Production and Sale of Tutorial
Videotapes - Claudia Mazzetti/Richard Fikes
* Membership Committee - Bruce Buchanan
* Publications Committee - Lee Erman
* IJCAI-85 Report - Saul Amarel
* Conference Committee - Marty Tenenbaum
* Future sites - Claudia Mazzetti
* Change in the time year for conference - Bonnie
Lynn Webber
* Workshop Program - John McCarthy
PROPOSED PROJECTS
* On-line Library and abstract project - Mike Genesereth
* Fellowship Program - John McCarthy
* Prize Proposal - Peter Hart
* AAAI support of NPR - Peter Hart
TRANSFER OF PRESIDENCY TO WOODY BLEDSOE, PRESIDENT (1984-1985)
* New Workshop Proposals
* Long Range Planning for the association
-------
∂27-Jul-84 1414 IAM
i have a hard copy of the 2nd section of chpt 3, ian
∂28-Jul-84 1100 JMC*
reservations
∂28-Jul-84 1100 JMC*
selfridge
∂28-Jul-84 1227 ENGELMORE@SUMEX-AIM.ARPA Re: AI Magazine policy needed
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Jul 84 11:18:41 PDT
Date: Sat 28 Jul 84 11:17:24-PDT
From: Bob Engelmore <ENGELMORE@SUMEX-AIM.ARPA>
Subject: Re: AI Magazine policy needed
To: Jon.Doyle@CMU-CS-C.ARPA, McCarthy@SU-AI.ARPA, Bledsoe@UTEXAS-20.ARPA
cc: Carbonell@CMU-CS-C.ARPA, McDermott@CMU-CS-C.ARPA, Sleeman@SUMEX-AIM.ARPA,
doyle@CMU-CS-C.ARPA
In-Reply-To: Message from "Jon.Doyle@CMU-CS-C.ARPA" of Wed 25 Jul 84 11:11:08-PDT
Home Phone: (415) 322-0627
Office Phone: (415) 327-6600
Jon,
I would feel better talking to you directly about this matter rather than
using this impersonal medium. However, let me try to respond to your
last message here, in case I don't see you in Austin or somewhere else.
You were indeed the victim of mistakes that were made by me and others
on the staff. The most serious was our failure to send you a copy of
the edited manuscript for your review and approval. We've had no
consistent policy on doing this, but we've now adopted a policy which
includes sending formatted "galleys" to authors for review. However,
we do reserve the right to make changes in an article when we think
those changes (usually minor) will improve the article. The author,
of course, reserves the right to refuse to publish his/her work in the
Magazine. (I'm sure that in the case of your article, if we had
followed the new policy, we would have reached a satisfactory
compromise on all details.) I intend to discuss this policy further
at the Publications Committee meeting in Austin, and you're welcome to
attend and comment.
I sincerely apologize for any embarrassment I've caused you. I will
personally talk to Ed Feigenbaum about the the typo which resulted in
a non-attribution of his comments, and will note this error in the
next issue of the magazine. I hope you have not lost all faith in the
magazine, and will give us another chance, as I have very high regard
for your work and the excellence of the articles you have submitted to
the AI Magazine.
Sincerely,
Bob Engelmore
-------
∂29-Jul-84 1136 HST ai-memos
hi john!the ai-memos and stan-cs-memos - are they somewhere on file?
∂29-Jul-84 2049 HST tex78
if i call tex, it does not understand commands from the latEX Document.
If i use tex78 it works well (with your macros), however, what is the counter-
part of magnify? (is there an old description?)Herbert
∂29-Jul-84 2122 @MIT-MC:MINSKY@MIT-OZ mail
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 29 Jul 84 21:22:34 PDT
Date: Mon 30 Jul 84 00:21-EDT
From: Marvin Minsky <MINSKY%MIT-OZ@MIT-MC.ARPA>
Subject: mail
To: jmc@SU-AI
I got a bunch of editing remarks from Stoyan, but my mail
file got clobbered. If you see him, could you ask him to re-send it?
-- Marvin
∂30-Jul-84 1010 GOLUB@SU-SCORE.ARPA [PRG5%vax2.ox@ucl-cs.arpa:]
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 10:09:14 PDT
Date: Mon 30 Jul 84 10:07:40-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: [PRG5%vax2.ox@ucl-cs.arpa:]
To: jmc@SU-AI.ARPA
John!
Are you interesred in seeing these people? Whom else might have
common interests with them? GENE
---------------
Return-Path: <@SU-AI.ARPA:PRG5%Vax2.ox.AC.UK%44d.Ucl-Cs.AC.UK@Ucl-Cs.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Mon 30 Jul 84 09:56:21-PDT
Received: from UCL-CS.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 09:57:20 PDT
Received: from [ox.vax2] by 44d.Ucl-Cs.AC.UK via Janet with NIFTP;
30 Jul 84 17:42 BST
Date: 30-JUL-1984 16:10:29
From: PRG5%vax2.ox@ucl-cs.arpa
To: GOLUB <GOLUB%su-ai.arpa@ucl-cs.arpa>
Dear Professor Golub,
I am spending 3 weeks this summer visiting computer science institutions in
the USA, and I would very much like to visit Stanford while I am in San
Francisco. My main interest is all aspects of functional programming, and
I am also interested in formal specification. My wife will be accompanying
me: she is also a computer scientist, and is interested in formal methods
for VLSI design (she has a paper on this subject in this year's LISP
conference). We both work at the University of Oxford's Programming
Research Group in England. We will be in San Francisco on the 15th, 16th and
17th of August. If we could arrange a visit on any of these days (preferably
the 17th), could you let me know? My network address is PRG5%OX.VAX2@UCL-CS,
or, should that fail, c/o HARPER%RLGM@UCL-CS.
Thank you!
John Hughes
Mary Sheeran
-------
∂30-Jul-84 1036 WIEDERHOLD@SUMEX-AIM.ARPA Re: bboard reading
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 10:36:50 PDT
Date: Mon 30 Jul 84 10:36:49-PDT
From: Gio Wiederhold <WIEDERHOLD@SUMEX-AIM.ARPA>
Subject: Re: bboard reading
To: JMC@SU-AI.ARPA
cc: ark@SU-AI.ARPA, mrc@SU-AI.ARPA, me@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 30 Jul 84 00:02:00-PDT
That should work well. I use NS to give public access to my Database
bibliography ( =biblio[1,gio] ). I would like the automatic concordance
to ignore all one letter words though. All authors are indexed by all their
initials. Gio
-------
∂30-Jul-84 1235 SHORTLIFFE@SUMEX-AIM.ARPA Council meeting
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 12:34:55 PDT
Date: Mon 30 Jul 84 12:31:06-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: Council meeting
To: jmc@SU-AI.ARPA
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
John,
I regret that I didn't know about my election to the Council in time
to make arrangements to be in Austin for the AAAI this year. I had other
commitments that week and was not planning on attending. I'll of course
be sure to attend Council meetings in the future now that I know far enough
in advance. Please let me know if there is anything I can do at a distance
despite my absence this year.
Thanks,
Ted
-------
∂30-Jul-84 1406 HOBBS@SRI-AI.ARPA Dry Run
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 14:06:11 PDT
Date: Mon 30 Jul 84 14:06:42-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Dry Run
To: commonsense.people: ;,
AIC-Staff: ;
I'll be giving a dry run for my presentation at AAAI on Commonsense Summer
at 3 pm this Thursday in EK242. The abstract of the talk is as follows:
Commonsense Summer:
A Premature Report
Jerry R. Hobbs
"Commonsense Summer" is a summer-long workshop being sponsored by the
Center for the Study of Language and Information at Stanford University
and by SRI International. It has long been agreed that intelligent
behavior requires a great deal of knowledge about the commonsense world.
But heretofore no one has embarked on a large-scale effort to encode
this knowledge. The aim of Commonsense Summer is to do the first three
months of such an effort. Eight graduate students from several
universities are participating in the workshop full-time, and a number
of other active researchers in the fields of knowledge representation,
natural language and vision are participating as well. We are
attempting to axiomatize in formal logic significant amounts of
commonsense knowledge about the physical, psychological and social
worlds, concentrating on eight domains: shape and texture, spatial
relationships, motion, properties of materials, preference and choice,
communication, relations between textual entities and entities in the
world, and responsibility. In this talk I will outline the approach we
are taking and describe some of the results that have been achieved so
far.
-------
∂30-Jul-84 1538 CHURD@SU-SCORE.ARPA LUNCHEON
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 15:38:31 PDT
Date: Mon 30 Jul 84 15:36:47-PDT
From: Cuthbert Hurd <CHURD@SU-SCORE.ARPA>
Subject: LUNCHEON
To: MCCARTHY@SU-SCORE.ARPA
Can your have lunch at noon on August 11, 1984 with David Warren, Dr. Yada,
Mr. Sugimoto, and me? Dr. Yada is President, CSK Research, said to be the
largest independent software company in Japan. We have had several meetings
and exchanges of information with CSK, and may wish them as a distributor.
The above is confidential. I am logging the various business requests I make
of you and we can make a settlement in blue berries, or a harder currency.
All good wishes. Cuthbert.
P.S. Nils Nillson is now interested in considering Stoyon's book.
-------
∂30-Jul-84 1538 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - Friday, August 3, l984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 15:38:07 PDT
Date: Mon 30 Jul 84 15:14:35-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - Friday, August 3, l984
To: siglunch@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, August 3, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Matt Ginsberg
Heuristic Programming Project
Stanford University
TOPIC: Non-monotonic Reasoning Using Dempster's Rule
ABSTRACT:
Rich's suggestion that the arcs of semantic nets be labeled so as to
reflect confidence in the properties they represent is investigated in
greater detail. If these confidences are thought of as ranges of
acceptable probabilities, existing statistical methods can be used
effectively to combine them. The framework developed also seems to be
a natural one in which to describe higher levels of deduction, such as
"reasoning about reasoning".
-------
∂30-Jul-84 1550 BSCOTT@SU-SCORE.ARPA Rutie Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Jul 84 15:50:08 PDT
Date: Mon 30 Jul 84 15:12:58-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rutie Adler
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Rutie Adler's references checked out with flying colors. I will offer her
the position this afternoon.
Betty
-------
∂30-Jul-84 2239 JK
∂17-Jul-84 1632 JMC schedule
I will also be making trips, so I wonder if you could let me know your
summer schedule, so I could plan to interesect? My own schedule is
in cal[1,jmc].
--------------
I will be in town till aug3, back again aug15
∂31-Jul-84 0311 PRG5%Vax2.ox.AC.UK%44d.Ucl-Cs.AC.UK@Ucl-Cs.ARPA
Received: from UCL-CS.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 03:10:56 PDT
Received: from [ox.vax2] by 44d.Ucl-Cs.AC.UK via Janet with NIFTP;
31 Jul 84 11:02 BST
Date: 31-JUL-1984 11:00:32
From: PRG5%vax2.ox@ucl-cs.arpa
To: JMC <JMC%su-ai.arpa@ucl-cs.arpa>
Dear Professor McCarthy,
We'll look forward to meeting you on the 17th. We'll be at the LISP conference
beforehand, so perhaps we should get directions to Stanford from you there.
Thanks a lot!
John Hughes
Mary Sheeran
∂31-Jul-84 0652 SIMONDS@CMU-CS-C.ARPA Re: bank account
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 06:51:55 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Tue 31 Jul 84 09:46:32-EDT
Date: Tue 31 Jul 84 09:46:05-EDT
From: Todd.Simonds@CMU-CS-C.ARPA
Subject: Re: bank account
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 31 Jul 84 01:51:00-EDT
John,
I'm still in P]ittsburgh, but will see to your bank account problemas soon
as I return. During the fall I epexpect to continue some relationship
with the Centre Mondiual (pardon the problem with the delete key) probably
in helping the research groups formulate their plans; I simply want to take
myself out of the catbird seat.
-- Todd
-------
∂31-Jul-84 0900 JMC*
tickets
∂31-Jul-84 0910 BSCOTT@SU-SCORE.ARPA Rutie Adler
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 09:10:23 PDT
Date: Tue 31 Jul 84 09:08:45-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Rutie Adler
To: JMC@SU-AI.ARPA, ZM@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Rutie has accepted the job. She would like to have a few days between jobs--
is it o.k. with you if she starts on August 27?
Betty
-------
∂31-Jul-84 1021 @USC-ECL.ARPA:FIKES@ECLD Chairing the Prize Paper Session
Received: from USC-ECL.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 10:21:26 PDT
Received: from ECLD by ECLA with ECLnet; Tue 31 Jul 84 10:15:45-PDT
Date: Tue 31 Jul 84 10:20:18-PDT
From: Richard Fikes <FIKES@ECLD.#ECLnet>
Subject: Chairing the Prize Paper Session
To: JMC@SU-AI.ARPA
cc: FIKES@ECLD.#ECLnet
John,
As I think you know, the program committee would like for you
to chair the session at which the publisher's prize papers will be
presented. And as we discussed, because of the concerns that may be
raised about Ron and his colleague winning prizes, we think it is
important that the prize selection process be explained in the
session introduction. To help you with that task, Ron and I have
written a script for the session to suggest the expected order of
events and the points to be made. That script follows.
Please confirm receipt of this message and that you are set up
to chair the session.
richard
SCRIPT FOR 1984 PUBLISHER'S PRIZE SESSION (AAAI-84)
Wednesday Afternoon, August 8, 1984 3:35 pm,
Concert Hall of the Performing Arts Center
John McCarthy begins session by saying a few words about the Publisher's
Prize. These comments would include the following points:
1) For each of the last three AAAI Conferences, the AAAI has awarded a
prize for the most outstanding paper or papers at the conference; each
year the cash portion of the prize has been donated by a publisher,
with this year's award of $1000 being given by The MIT Press.
2) Each year the conference Program Committee selects the winners.
This year, the Committee decided that because of the diversity of the
subfields of AI, it was inappropriate to select a single best paper.
Instead, the committee chose to select a group of outstanding papers,
and to divide the cash award equally among the papers in this group.
3) During the normal paper reviewing process, members of the Program
Committee were asked to look for and nominate outstanding papers
describing substantial and important research in AI. All told, twelve
papers were nominated for consideration for the prize. Each member of
the Program Committee was asked to read the entire set of papers, and
select those s/he thought best. Ron Brachman, the Program Chair, did
not vote in either the nomination or final selection processes.
Authors of nominated papers did not vote in the final selection
process.
4) Four papers clearly stood above the rest in the voting. Thus, the
Prize this year is being awarded to the following people:
Johan de Kleer, of Xerox PARC, for "Choices without Backtracking"
Hector Levesque, of Fairchild's Laboratory for Artificial Intelligence
Research, for "A Logic of Implicit and Explicit Belief"
Sandy Pentland, of SRI International, for "Shading Into Texture"
Ron Brachman and Hector Levesque, of Fairchild's Laboratory for
Artificial Intelligence, for "The Tractability of Subsumption
in Frame-Based Description Languages"
Ron Brachman and Hector Levesque offered to decline the award because
of Ron's position as Chairman of the Program Committee. In a
follow-up poll, the Program Committee insisted that they accept the
award, emphasizing that other considerations are secondary to the
primary intent of the prize to reward outstanding work. Ron and
Hector agreed to accept the prize but declined the cash part of the
award. They asked the Program Committee instead to award the cash to
the best paper written by a student. The recipient of that award is
Graeme Hirst, now of the University of Toronto, for "A Semantic
Process for Syntactic Disambiguation".
Graeme's paper was presented yesterday afternoon at the Natural
Language Understanding session. The four other prize winning papers
will be presented at this session.
5) Before the paper presentations, we would like to congratulate the
other authors of the nominated papers:
A.(?) Blake, of The University of Edinburgh
Bill Clancey, of Stanford University
Gary Cottrell, of The University of Rochester
John Laird, Paul Rosenbloom, and Allen Newell, of Carnegie-Mellon
University
Pat Langley and Stellan Ohlsson, of Carnegie-Mellon University
Jock Mackinlay and Mike Genesereth, of Stanford University
Stephen Westfold, of Stanford University and The Kestrel Institute
6) Finally, I would like to introduce Terry Ehling, of the MIT Press,
who will present the four checks.
Terry Ehling presents the checks....
McCarthy takes over, and runs the session as a regular session,
introducing each speaker in the following order:
3:40 de Kleer
4:05 Levesque
4:30 Pentland
4:55 Brachman (for the Brachman and Levesque paper)
Please keep the talks to 25 minutes, with no question/answer period.
Session ends approx. 5:20 or 5:30
-------
-------
∂31-Jul-84 1036 HOBBS@SRI-AI.ARPA Weekly Meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 10:36:42 PDT
Date: Tue 31 Jul 84 10:37:28-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Weekly Meeting
To: commonsense.people: ;
Meeting of Commonsense Summer people as usual tomorrow (Aug 1) at 10 am
in EK242. We'll talk about Yoav's work on shape, Marc and Len's work
on motion verbs, Tom and Phil's work on suggestions and offers, and
any thoughts that have occurred to anyone since last week about what
we talked about then. For those who want to prepare for the meeting
you might want to look at writeups that will be on the <COMMONSENSE>
directory by later today -- SHAPE1.. (or SHAPE1.SCR), VERBS.MOTION,
and SPEECH.ACTS.
-- Jerry
-------
∂31-Jul-84 1045 AAAI-OFFICE@SUMEX-AIM.ARPA 35mm Slide Requirements
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 10:45:51 PDT
Date: Tue 31 Jul 84 10:45:57-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: 35mm Slide Requirements
To: jmc@SU-AI.ARPA
cc: brachman@SRI-KL.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John:
According to Steve Parks, the technician for the Performing Arts
Center at UT, the approximate estimate for lines per 35mm slides
is 12 rows of 48 pt. lettering.
Claudia
-------
∂31-Jul-84 1047 HOBBS@SRI-AI.ARPA Re: the dry runs
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 10:47:36 PDT
Date: Tue 31 Jul 84 10:48:42-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Re: the dry runs
To: JMC@SU-AI.ARPA
cc: hobbs@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 30 Jul 84 14:14:00-PDT
John --
I asked around and unfortunately, few of the relevant people will be
here this afternoon. Tomorrow morning is a bit pressed also, since
there is a natural language group meeting at 11 and that would make
things tight if we did the dry run for the commonsense meeting.
It's a shame however that most of the students will not be able to
hear your talk. I guess Wednesday afternoon and Friday are definintely
out?
-- Jerry
-------
∂31-Jul-84 1246 jbn@FORD-WDL1.ARPA Re: Bulletin board organization
Received: from FORD-WDL1.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 12:46:26 PDT
Return-Path:<>
Date: 31-Jul-84 12:48:14-PDT
From: jbn@FORD-WDL1.ARPA
Subject: Re: Bulletin board organization
To: jmc@SU-AI.ARPA
Cc: jbn@FORD-WDL1.ARPA
I don't really expect anyone to implement anything either, since
nothing has been done in the SCORE/SAIL/SIERRA community about this
problem in the last two years. The problem of automatically managing
uncontrolled items posted by diverse parties may be worthy of a PhD thesis,
and is one of those nice problems where a scheme that works most of the
time is acceptable. I keep waiting for somebody to apply AI techniques
to some routine problem in the Stanford CS community; it hasn't happened
yet.
I'd be tempted to tackle it myself were I not already involved in a
sizable project.
Incidentally, on the subject of character recognition, there is now
a character recognition system available for $495 from Oberon Associates.
It uses a wand-like device which one manually passes over typed copy, line
by line. I don't know if it is any good, but it is at least reasonably
priced. The Kurtzwell reading machine for the blind is real, by the way;
it costs about $20K and resembles a desktop copier. The VA hospital in
Palo Alto has one. Reports are that it more or less works, and is very
sensitive to angular misalignment of the page. I once read that it uses
three separate character recognition algorithms and combines the results
in some way, but I don't think that the details of how it really works
have been published.
John Nagle
(Nagle@SCORE)
∂31-Jul-84 1356 BSCOTT@SU-SCORE.ARPA Sarah
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 13:55:59 PDT
Date: Tue 31 Jul 84 13:54:24-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Sarah
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
I propose to pay Sarah $9.00/hour. This is a little more than a comparable
secretary's salary, but I justify it because she has no "benefits." Does this
sound reasonable to you?
Betty
Betty
-------
∂31-Jul-84 1403 ELYSE@SU-SCORE.ARPA Sjodin file
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 14:03:01 PDT
Date: Tue 31 Jul 84 14:01:24-PDT
From: Elyse J. Krupnick <ELYSE@SU-SCORE.ARPA>
Subject: Sjodin file
To: jmc@SU-AI.ARPA
Do you have the Gunnar Sjodin file? Gene thought it might be with you.
If you do please let me know and I'll come and get it.
Elyse
-------
∂31-Jul-84 1417 BSCOTT@SU-SCORE.ARPA Re: Sarah
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Jul 84 14:17:49 PDT
Date: Tue 31 Jul 84 14:10:04-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Sarah
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 31 Jul 84 14:01:00-PDT
I think it's a fair amount in comparison to other salaries around here.
Betty
-------
∂31-Jul-84 1434 SJG
\magnification=\magstep3
\hsize=6truein\vsize=4truein
\openup 6pt
\nopagenumbers
\raggedright\pretolerance=10000
\def\isa{{\rm isa}}\def\ost{{\rm ostriches}}\def\bird{{\rm birds}}
\def\abird#1{{\rm bird}(#1)}\def\afly#1{{\rm flies}(#1)}
\def\aost#1{{\rm ostrich}(#1)}
\def\fly{{\rm flyers}}\def\T{{\rm Tweety}}
\def\isarr#1{\buildrel{#1}\over\longrightarrow}
\def\isarrow#1#2{\mathrel{\mathop{\longrightarrow}\limits↑{(#1\;\; #2)}}}
\def\pair#1#2{(#1\;\; #2)}
\def\itemb{\item{$\bullet$}}\def\itemx{\par\hang\indent\ignorespaces}
\def\itemxx{\par\indent\hangindent2\parindent\indent\ignorespaces}
\def\news{\hbox{newspaper-article}}\def\E{\hbox{Enquirer-article}}
\def\valid{\hbox{valid}}
\def\r{\hbox{rule}}\def\app{\hbox{applies}}
\centerline{\bf Non-monotonic reasoning}
\centerline{\bf using Dempster's rule}
\bigskip
\centerline{M.L. Ginsberg}
\centerline{Department of Computer Science}
\centerline{Stanford University}
\centerline{Stanford, CA 94305}
\vfill\eject
{\obeylines
\noindent Discuss three things:
\medskip
\itemb why probabilities?
\itemb why Dempster's rule?
\itemb reasoning about reasoning
\vfill\eject
∂31-Jul-84 1440 SJG slide maker
Lois Thornhill
Stanford Design Associates
415-327-9398
P.O. Box 6041, Palo Alto
∂31-Jul-84 1600 JMC*
cleaning
∂01-Aug-84 0000 JMC*
Shubik has boden.
∂01-Aug-84 0040 Brachman@SRI-KL.ARPA Re: 35mm Slide Requirements
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 1 Aug 84 00:40:04 PDT
Date: Tue 31 Jul 84 14:05:00-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
Subject: Re: 35mm Slide Requirements
To: AAAI-OFFICE at SUMEX-AIM, jmc at SU-AI
In-Reply-To: Your message of Tue 31 Jul 84 12:59:20-PDT
John - just to clarify on the 35 mm slides...
The number Claudia sent you was for transparencies, on which the letters
must be about 1/2" high to be legible when projected. For 35mm slides,
be careful about aspect ratio (my guidebook from Kodak says lay out an
area 6" wide by 4-1/2" high), and use about 12 lines per slide. We are
using a 6" x 4-1/2" template, and are using between 14 and 24 point
fonts (24 pt, and sometimes 29 pt, for titles).
-Ron
-------
∂01-Aug-84 0935 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 1 Aug 84 09:35:06 PDT
Date: Wed 1 Aug 84 09:25:37-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: commonsense.people: ;
Commonsense Summer meeting this morning at 10 am in EK242.
-- Jerry
-------
∂01-Aug-84 0941 CSL.ALLISON@SU-SIERRA.ARPA Can you schedule an interview appointment?
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 1 Aug 84 09:41:30 PDT
Date: Wed 1 Aug 84 09:40:02-PDT
From: Dennis Allison <CSL.ALLISON@SU-SIERRA.ARPA>
Subject: Can you schedule an interview appointment?
To: jmc@SU-AI.ARPA, lenat@SU-SCORE.ARPA
cc: csl.allison@SU-SIERRA.ARPA
Asao Ishizuka, managing editor of Nikkei BYTE, would like to interview
you regarding your perception vis a vis the state of computing in the
year 2000. This interview (together with others) will be a lead article
for the initial issue.
Asao will be at AAAI in Austin beginning next Monday. If you plan to
attend he could do the interview there. Otherwise it can be conducted
by telephone.
Dennis Allison
-------
-------
∂01-Aug-84 1435 ullman@diablo McCarthy/Talcott book
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 1 Aug 84 14:32:33 PDT
Date: Wed, 1 Aug 84 14:32:32 pdt
From: Jeff Ullman <ullman@diablo>
Subject: McCarthy/Talcott book
To: jmc@sail
Have you signed a contract for your book yet?
If not, I'd like to talk to you about signing with CSP.
∂01-Aug-84 1952 DFH time meeting
The guy from Time is Dick Thompson, his number is 415 982-5000.
∂02-Aug-84 1213 DFH Time Mag.
Dick Thompson, will come at the same time as the photographer on Sat.
and do the interview then.
∂02-Aug-84 1240 DFH P. Sprague
Peter Sprague from the computer museum called again to find out the date of
the movie which you gave them.
∂02-Aug-84 1702 JOHN@SU-CSLI.ARPA kuo
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Aug 84 17:02:17 PDT
Date: Thu 2 Aug 84 17:00:28-PDT
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: kuo
To: jmc@SU-AI.ARPA
Earlier we had thought it would be a good thing to support victor,
given his rather unique position in Chinese AI and interesting background,
if he wasnt a complete loss. But it was hard to tell. Now we have your
positive reaction to the paper, and it impressed me too, but I havent
spent much time on it. On the other hand, we may or may not be funded
at anywhere near the level we expected.
-------
∂02-Aug-84 1705 JOHN@SU-CSLI.ARPA kuo
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 2 Aug 84 17:05:25 PDT
Date: Thu 2 Aug 84 17:03:35-PDT
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: kuo
To: jmc@SU-AI.ARPA
cc: betsy@SU-CSLI.ARPA
Earlier we had thought it would be a good thing to support victor,
given his rather unique position in Chinese AI and interesting background,
if he wasnt a complete loss. But it was hard to tell. Now we have your
positive reaction to the paper, and it impressed me too, but I havent
spent much time on it. On the other hand, we may or may not be funded
at anywhere near the level we expected.
Would you be willing to spend some ofyour initiator money n him, if it
turns out that we are strapped and there are no extra funds for next
year.
Suppose you and I each put up $3000 and a similar amount came from
the Foundatons matcing funds. That would give him 12,000. The idea
could be that we would do this if it turns out that our funding
really will be cut drastically. At this point, we seem to be getting
different signals from different parts of SDF, but the situation should
be clearer tomorrow. Victor needs to know real soon. You willing to
thus gamble?
I am assuming you have been told about initiatro money.
-------
∂03-Aug-84 0410 ARK Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 3 August 1984
Previous Balance 1.39
Monthly Interest at 1.5% 0.02
Current Charges 1.65 (vending machine)
-------
TOTAL AMOUNT DUE 3.06
Please deliver payments to Rosemary Napier, room 340, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂03-Aug-84 1100 JMC*
Ruzena 215 898-6222
∂04-Aug-84 1403 JOHN@SU-CSLI.ARPA Re: Kuo
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 4 Aug 84 14:03:12 PDT
Date: Sat 4 Aug 84 14:01:00-PDT
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: Re: Kuo
To: JMC@SU-AI.ARPA
cc: JOHN@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 4 Aug 84 14:01:00-PDT
Yes, thats what it is. I'll pass your message on to Betsy, and my
willingness to use some of mine.
-------
∂05-Aug-84 0813 GHG Help
john!
Is there a photo command on SAIL?
GENE
∂05-Aug-84 1705 ME news blackout last week
To: JMC@SU-AI.ARPA, ARK@SU-AI.ARPA, GFF@SU-AI.ARPA, BH@SU-AI.ARPA,
YM@SU-AI.ARPA
The NS new blackout last week resulted from a phone company device going
into loopback mode, thus cutting off our news line (used for both wires).
There wasn't anything wrong with the NS software; it was just waiting for
something to come in. Both wires are working fine now.
∂06-Aug-84 0845 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT!!!
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 6 Aug 84 08:43:29 PDT
Date: Mon 6 Aug 84 08:41:21-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT!!!
To: siglunch@SUMEX-AIM.ARPA
Due to the AAAI conference this week, there will be NO SIGLUNCH this
Friday, August 10, l984. Be prepared for a slight change next week.
SIGLUNCH for next week will be on THURSDAY, August 16, l984. More
information next week. Motoi Suwa will be the speaker.
-------
∂07-Aug-84 1208 minker@maryland.arpa ABSTRACT and Social SEC. No.
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 7 Aug 84 12:08:21 PDT
Received: From maryland-gw.arpa by csnet-relay; 7 Aug 84 14:49 EDT
Received: by maryland.ARPA (4.12/4.7)
id AA02897; Tue, 7 Aug 84 14:45:59 edt
Date: Tue, 7 Aug 84 14:45:59 edt
From: Jack Minker <minker@maryland.arpa>
Message-Id: <8408071845.AA02897@maryland.ARPA>
To: Barwise%su-csli.arpa%csnet-relay.csnet@maryland.arpa,
JMC%SU-AI@csnet-relay.arpa, Reiter%ubc.csnet@csnet-relay.arpa,
decvax!watmath!mhvanemden%Berkeley@csnet-relay.arpa,
henschen%ANL-MCS.ARPA@csnet-relay.arpa
Subject: ABSTRACT and Social SEC. No.
Dear Jon, Larry, John, Ray and Maarten,
.pp
I have received only two abstracts, one from Larry and the other one
from Maarten that I sent you. Please send me an abstract of your talk.
The schedule of lectures was sent to you earlier, but is enclosed
again. We have funds to support students and some faculty at the rate
of $250 per person for the week. If you know of any students who we
should support, send me their names and addresses or have them send
me mail directly.
.pp
Please send me your social security number or equivalent (for Maarten
and Ray), so that we can expedite your honoraria. I will ask the
Math Department to make reservations for all of you for the evenings
of October 21, 22, 23, 24 and 25, except for John for whom I will reserve a
room for October 21 and October 22. If you want other arrangements,
please let me know at your earliest convenience.
.pp
I would appreciate hearing from you as soon as possible.
.pp
The schedule is as follows:
.sp 2
.ce
Logic and its Role in Artificial Intelligence
.sp 2
Monday Ray Reiter
.ti +5
Logic for Specification: Databases, Conceptual Models
.ti +5
and Knowledge Representation Languages
.sp
Tuesday John McCarthy
.ti +5
The Mathematics of Circumscription
.sp
Wednesday Maarten Van Emden
.ti +5
Strict and Lax Interpretation of Rules in
.ti +5
Logic Programming
.sp
Thursday Jon Barwise
.ti +5
Constraint Logic
.sp
Friday Larry Henschen
.ti +5
Compiling Constraint Checking Programs
.ti +5
in Deductive Databases
∂08-Aug-84 1713 DFH
A man by the name of Ravi Gomatan called , he wishes to speak to you, please
call himat (415) 566-9017.
∂08-Aug-84 1825 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 8 Aug 84 18:24:55 PDT
Date: Wed 8 Aug 84 18:23:35-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: lunch
To: JMC@SU-AI.ARPA
Are you free to have lunch with me and Spencer ( head of Xerox Parc)
on Thursday, Aug 23?
GENE
-------
∂09-Aug-84 0717 CL.BOYER@UTEXAS-20.ARPA Next Lisp Conference
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 9 Aug 84 07:17:07 PDT
Date: Thu 9 Aug 84 09:16:51-CDT
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Next Lisp Conference
To: jmc@SU-AI.ARPA
I don't recall seeing you at the meeting about the next
conference. The following decisions were made. Rich
Gabriel is the general chairman, John Williams is the
program chairman, and we will not meet in close proximity to
AAAI.
-------
∂09-Aug-84 0843 jim@SCRC-STONY-BROOK.ARPA new NUSUM, etc.
Received: from SCRC-STONY-BROOK.ARPA by SU-AI.ARPA with TCP; 9 Aug 84 08:42:12 PDT
Received: from SCRC-MISSISSIPPI by SCRC-STONY-BROOK via CHAOS with CHAOS-MAIL id 70286; Thu 9-Aug-84 11:41:37-EDT
Date: Thu, 9 Aug 84 11:41 EDT
From: "James E. O'Dell" <jim@SCRC-CUPID.ARPA>
Subject: new NUSUM, etc.
To: rwg%SPA-NIMBUS@SCRC-RIVERSIDE.ARPA
Cc: macsyma%SPA-NIMBUS@SCRC-RIVERSIDE.ARPA, "jmc@sail"@MIT-MC.ARPA,
macsyma-i%SPA-NIMBUS@SCRC-RIVERSIDE.ARPA,
moon%SPA-NIMBUS@SCRC-RIVERSIDE.ARPA, knuth@MIT-MC.ARPA
In-reply-to: <840808184916.4.RWG@SPA-COLORADO.SPA.Symbolics>
Reply-to: Jim@SCRC-STONY-BROOK.ARPA
Date: Wednesday, 8 August 1984, 18:49-PDT
From: Bill Gosper <rwg@SPA-NIMBUS>
...
For the courageous (and patient--the translator seems to be broken), the "Alpha
-test" file is "n:>rwg>macsyma>nusum.macsyma". "Nusum.demo" runs a number of
interesting examples. Suggestions welcome, including better names for UNDIFFERENCE,
CLOSEDFORM, etc. Also welcome are reports of good or bad experiences.
...
Try a eval←when([batch,translate],simp:false ......
rather than your block([simp:false],.......
around your tellsimp rules. I tried this and seemed to win but
later on in the nusum file I got other symtax errors around funcsolve,
I believe.
∂09-Aug-84 1101 DFH
A fellow by the ame of Jim Knox called from a company called Management
Rrecruiters in Seattle; he has a client in need of people in AI, and wanted to
know if you could reccomend some people. His number is (206) 328-0936. he is
planning to call back on Monday.
∂09-Aug-84 1210 DFH
John Cocke called, he will call again next week.
∂10-Aug-84 1343 @MIT-MC:rwg%SPA-NIMBUS@SCRC-STONY-BROOK new NUSUM, etc.
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 10 Aug 84 13:43:20 PDT
Received: from SPA-COLORADO by SPA-Nimbus with CHAOS; Fri 22-Jun-84 11:21:23-PDT
Date: Wed, 8 Aug 84 18:49 PDT
From: Bill Gosper <rwg%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA>
Subject: new NUSUM, etc.
To: macsyma%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA
Cc: "jmc@sail"@MIT-MC.ARPA, macsyma-i%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA,
moon%SPA-NIMBUS@SCRC-STONY-BROOK.ARPA, knuth@MIT-MC.ARPA
Message-ID: <840808184916.4.RWG@SPA-COLORADO.SPA.Symbolics>
The imminence of Moon's EGC has psychologically freed me to generate some
serious garbage, in the form of enhancements to NUSUM which include:
PRODGUNCH (was already there), shifts designated variable in all PRODs,
FACTORIALs, etc, by designated amount, without affecting value. E.g.,
PRODGUNCH(n!,n,1) → (n+1)!/(n+1).
In what follows, a "hyperrational" expression (Knuth's term) is any whose
ratio for consecutive values of its index variable is a rational function.
I.e., the general term of any generalized hypergeometric series, i.e.
hyperratp(exp,n):=?ratp(prodgunch(exp,n,1)/subst(n+1,n,exp),n). (The domain of
NUSUMmands is the hyperrational functions.)
UNDIFFERENCE (which maybe should be called INDEFSUM), the inverse
of the backward difference operator on hyperrational expressions.
UNDIFFERENCE is to NUSUM as INTEGRATE (of two args) is to LDEFINT.
HYPERRATSIMP(exp,n) expands to minimal number of hyperrational terms.
NUSUM and UNDIFFERENCE now call HYPERRATSIMP on their summands, and work
termwise on the results. This permits summands like n + 2↑n + n*n!, which
were formerly illegal. I have been unable to appropriately extend the
NUSUM completeness proof, but I'm sure it's still a decision procedure.
NUSUM and UNDIFFERENCE now return partial solutions in the absence of closed
forms. This permits the inclusion of undetermined coefficients in summands,
which can later be assigned so as to annihilate the residual summand returned
by NUSUM or UNDIFFERENCE. (WGD tells me this is the crux of Sister Celine's
method of churning up identities.)
SUMIFY converts PRODs to e↑SUMs,
PRODIFY converts SUMs to logs of PRODs.
PRODCONTRACT is analogous to SUMCONTRACT, but more vigorous. I advocate
similar envigoration of SUMCONTRACT.
LINCHANGEVAR is like changevar on SUMs and PRODs, except permits non-monic
linear relationship between newvar and oldvar.
LINCHANGE(exp,a*n+b) changevars all the SUMs and PRODs over n according
to n _ a*n+b. It will also gronk any SUMs and PRODUCTs over a and b !
UNTUPLE(exp,k) will attempt to k-tuple the range of SUMs (I just noticed
I forgot to do PRODs!) by un-k-tupling the summands. E.g.,
sum(hyperratsimp(f(n)+f(n+1/2),n),n,a,b); untuple(%,2) should give
sum(f(n/2),n,2*a,2*b+1), for hyperrational f. Subtlety:
neither (n/2)! nor ((n+1)/2)! is hyperrational, but their product is.
FUNCSOLVE is being remodeled.
CLOSEDFORM (ahem) attempts to replace all SUMs and PRODs in its argument
with closed forms. Finite SUMs are given to NUSUM, finite PRODs are made
into factorials. Infinte SUMs and PRODs of rational functions are given
to a new system of routines which make a fairly thorough attempt to produce
elementary functions via factorial and polygamma reduction formulae. E.g.,
Time= 3730.0 msecs.
(D687) N:>rwg>nusum.writef.1
(This took 3.7 seconds to open the wrong file! I said writefile(">rwg>macsyma>nusum.writef")!)
(C688) PRODUCT(1+N↑-4,N,1,∞);
Time= 83.3 msecs.
∞
/===\
! ! 1
(D688) ! ! (-- + 1)
! ! 4
N = 1 N
(C689) RATSIMP(CLOSEDFORM(%));
Time= 10200.0 msecs.
2 SQRT(2) π 2 SQRT(2) π 2 SQRT(2) π 2 SQRT(2) π
COS (---------) SINH (---------) + COSH (---------) SIN (---------)
2 2 2 2
(D689) -------------------------------------------------------------------
2
π
(C690) SUM(1/(N↑2-N-1)↑2,N,0,∞);
Time= 217.0 msecs.
∞
====
\ 1
(D690) > -------------
/ 2 2
==== (N - N - 1)
N = 0
(C691) CLOSEDFORM(%);
Time= 11100.0 msecs.
2 2 (SQRT(5) - 1) π (SQRT(5) - 1) π
π CSC (---------------) 2 SQRT(5) π COT(---------------)
2 2 4 SQRT(5) 4 4 SQRT(5)
(D691) ------------------------ + -------------------------------- + ---------------- + ---------------- + ----------------
5 25 25 (SQRT(5) + 1) 2 25 (SQRT(5) - 1)
5 (SQRT(5) + 1)
4
+ ----------------
2
5 (SQRT(5) - 1)
(It does all the rational sums in Knopp. I am trying to get some bigger
tables. Its main application might be to problems too ugly for tables.)
PRODands may also contain constants to rational-function powers, even if
the sums of these powers don't converge by themselves.
I would like to extend PRODands to include polynomials to polynomial powers,
but this would require MACSYMA to standardize on a notation for higher
factorials. (The least alien notation, thought by no means the prettiest,
would be exponentials of polygammas of negative index. But given the
resistance I get to MACSYMA supporting mere polylogarithms of negative index,
. . .)
For the courageous (and patient--the translator seems to be broken), the "Alpha
-test" file is "n:>rwg>macsyma>nusum.macsyma". "Nusum.demo" runs a number of
interesting examples. Suggestions welcome, including better names for UNDIFFERENCE,
CLOSEDFORM, etc. Also welcome are reports of good or bad experiences.
(Implementors: If the current behavior of INTEGRATE is satisfactory, (i.e.
taking four or two args, with the noun form displaying with or without limits,
accordingly), then please consider extending the analogous behavior to SUM.
Then UNDIFFERENCE(f(n),n) could become SUM(f(n),n). Similarly for PROD.)
∂10-Aug-84 2048 CHURD@SU-SCORE.ARPA LUNCH, AUGUST 11.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 10 Aug 84 20:48:15 PDT
Date: Fri 10 Aug 84 20:46:55-PDT
From: Cuthbert Hurd <CHURD@SU-SCORE.ARPA>
Subject: LUNCH, AUGUST 11.
To: MCCARTHY@SU-SCORE.ARPA
Dr. Yada, Mr. Sugimoto, David Warren, Caroyn, and I will be at Rickey's
Hyatt House at noon on August 11. We look forward to your joining us.
If you prefer, you could come to Quintus at 2345 Yale Street a little
bit earlier. One block off El Camino, just befoe California as you come
south. Hope the conference was a success, I know your speech was great.
Cuthbert
P. S. Caroyn should be spelled Carolyn with Morris added.
-------
∂13-Aug-84 0605 ATP.BLEDSOE@UTEXAS-20.ARPA Re: promoting basic research in AI
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 06:04:59 PDT
Date: Mon 13 Aug 84 08:04:46-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: promoting basic research in AI
To: JMC@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 11 Aug 84 10:17:00-CDT
John,
I agree with you on the AI basic research issue. Large companies
are still having trouble doing much if any basic research (ironically
IBM did a large fraction of the early work). Poor TI seems to loose
their people about as fast as they emerge as competant, but they
are big enought to contribute. MCC says that they are doing long
term research in AI but our time-scale is 10 years and that is rather
short really; I hope to have a spectrum that includes some long
term components. In the long run if we can't do basic research I
probably won't stay. (A confidential remark).
But all in all I still rely on the universities and the AI
Labs associated therewith, to carry most of the load.
I will officially appoint you chairman of this
soon. Let me ask you to suggest other committe members (if any)
before I appoint the whole committee.
Woody
-------
∂13-Aug-84 0840 DOYLE@CMU-CS-C.ARPA Re: non-monotonic
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 08:39:54 PDT
Received: ID <DOYLE@CMU-CS-C.ARPA>; Mon 13 Aug 84 11:37:56-EDT
Date: Mon 13 Aug 84 11:37:55-EDT
From: Jon.Doyle@CMU-CS-C.ARPA
Subject: Re: non-monotonic
To: JMC@SU-AI.ARPA
cc: doyle@CMU-CS-C.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 12 Aug 84 15:22:00-EDT
John,
The term "non-monotonic" of my paper with Drew comes from the term
"non-monotonic justifications" of my truth maintenance work of 1976,
which the logic was aimed at formalizing. I in turn adopted the
adjective from the appendix of Minsky's 1974 frame paper, where he
criticized the "monotonicity" of logic.
I think Drew is MCDERMOTT@YALE, but I am not sure. I don't know his
phone numbers.
Jon
-------
∂13-Aug-84 0841 DOYLE@CMU-CS-C.ARPA Re: non-monotonic
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 08:40:58 PDT
Received: ID <DOYLE@CMU-CS-C.ARPA>; Mon 13 Aug 84 11:38:59-EDT
Date: Mon 13 Aug 84 11:38:59-EDT
From: Jon.Doyle@CMU-CS-C.ARPA
Subject: Re: non-monotonic
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 12 Aug 84 15:22:00-EDT
P.S.
I really enjoyed the talk.
Jon
-------
∂13-Aug-84 0900 JMC*
Dest 408 946-7100
∂13-Aug-84 0900 JMC*
Ask Freedom House about Aid for Afghans.
∂13-Aug-84 1004 DFH
I got a request to call Doris Hyde at III (213) 390-8611. I receivedd this
message on Friday, but it was too late to call.
∂13-Aug-84 1505 MULLEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT - THURSDAY, August 16, l984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 15:04:55 PDT
Date: Mon 13 Aug 84 15:00:30-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT - THURSDAY, August 16, l984
To: siglunch@SUMEX-AIM.ARPA
PLEASE NOTE change of day -- FOR THIS SIGLUNCH ONLY!!!
SIGLUNCH
DATE: THURSDAY, August 16, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Motoi Suwa, Director
Man-Machine Studies
Electrotechnical Laboratory, Tsukuba
TOPIC: Introduction to AI Work at ETL
ABSTRACT:
Electrotechnical Laboratory (ETL), which played an important role in
launching the Fifth Generation Computer Project of Japan, includes one
of the largest AI research groups in Japan. The talk will cover the
outline of AI work at ETL such as (1) computer vision, (2) speech
recognition, (3) natural language understanding, (4) robotics, (5)
expert system, (6) design of human interface, and (7) AI architecture.
-------
∂13-Aug-84 1609 HOBBS@SRI-AI.ARPA Meeting Thursday instead of Tuesday
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 16:09:22 PDT
Date: Mon 13 Aug 84 16:13:08-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Thursday instead of Tuesday
To: commonsense.people: ;
We'll have the general meeting Thursday morning at 10 am in EK242, instead
of Tuesday as I had announced last meeting. We'll talk about speech acts,
decision making and determiners. Write-ups on these things should be on
the <COMMONSENSE> directory by sometime Wednesday afternoon in files called
SPEECH-ACTS.*, DECISION.* and DETERMINER.*.
-- Jerry
-------
∂13-Aug-84 1714 DFH Veronica Dahl's visit
∂08-Aug-84 1846 PEREIRA@SRI-AI.ARPA Veronica Dahl's visit
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 8 Aug 84 18:45:58 PDT
Date: Wed 8 Aug 84 18:46:33-PDT
From: PEREIRA@SRI-AI.ARPA
Subject: Veronica Dahl's visit
To: dfh@SU-AI.ARPA
When Veronica Dahl visited here at Prof. McCarthy's and my invitation,
she was under the impression that besides travel and subsistence (which
were paid from CSLI funds), there would be a (small) honorarium for
her talk. As I am not familiar with the procedures at Stanford, I
wasn't able to do anything on this matter. However, I understand that
the question of an honorarium was first mentioned by Prof. McCarthy.
I would be very grateful if you could help clarify this matter.
-- Fernando Pereira
-------
∂13-Aug-84 2031 LLW@S1-A.ARPA Home Stretch
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 13 Aug 84 20:31:05 PDT
Date: 13 Aug 84 2031 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Home Stretch
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
John, I understand that the Bureau of Personnel Management folks have
*finally* completed their work, and have forwarded their background
investigation report to the DoE San Francisco Regional Office. These
people are expected to be contacting you in the very near future to ask
you to come in for a formal (e.g., sworn, transcript-generating, with
multiple Government participants) interview with them. This interview
immediately precedes their making their Big Decision. If you'ld care for
whatever advice I can offer in preparation for this particular little
governmental peculiarity, it's yours for the asking. In any case, good
luck in comprehensively dodging dontopedologia! Lowell
∂14-Aug-84 0613 ATP.BLEDSOE@UTEXAS-20.ARPA A paper of yours
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 06:13:46 PDT
Date: Tue 14 Aug 84 08:13:32-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: A paper of yours
To: jmc@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
Some our people at MCC would like a copy of your paper "Applications
of Circumscription to Formalizing Common Sense Knowledge". Could
you point us to it? Woody
-------
∂14-Aug-84 0811 BSCOTT@SU-SCORE.ARPA Re: Veronica Dahl honorarium
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 08:11:21 PDT
Date: Tue 14 Aug 84 08:09:53-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Veronica Dahl honorarium
To: JMC@SU-AI.ARPA, DFH@SU-AI.ARPA, pereira@SRI-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 13 Aug 84 18:37:00-PDT
John, I'll talk to Sarah about this. For a non-citizen there is more to do.
Sarah, would you please see me.
Betty
-------
∂14-Aug-84 0930 DFH
Joyce Fredrick at the Hoover Institute wants to invite you to a reception. Please
return her call at 497-2063.
∂14-Aug-84 0932 DFH V.Dahl
How do a know whether "Fernando" has her social security number? I need
to know whether I need to call Vancouver.
∂14-Aug-84 1119 GEORGEFF@SRI-AI.ARPA Transport to workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 11:19:24 PDT
Date: Tue 14 Aug 84 11:16:25-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Transport to workshop
To: lamport@SRI-CSL.ARPA, pratt@SU-AI.ARPA, jmc@SU-AI.ARPA,
waldinger@SRI-AI.ARPA, stan@SRI-AI.ARPA, goguen@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, BARWISE@SU-CSLI.ARPA,
HALPERN%ibm-sj.csnet@CSNET-RELAY.ARPA, lansky@SRI-CSL.ARPA,
pereira@SRI-AI.ARPA, georgeff@SRI-AI.ARPA, konolige@SRI-AI.ARPA,
stuart@SRI-AI.ARPA, yom@SU-AI.ARPA
I need to arrange transport for visitors from interstate and
overseas to the workshop from SRI and the Stanford Park Hotel.
If you are taking a private car to Monterey, and have room for
additional people, could you please let me know how many people
you are prepared to take. If you are not taking your own car, and
need transport yourself, please let me know asap.
Thanks for your assistance.
Mike.
-------
∂14-Aug-84 1346 ASHOK@SU-SCORE.ARPA About this project ...
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 13:46:48 PDT
Date: Tue 14 Aug 84 13:44:17-PDT
From: Ashok Subramanian <ashok@SU-SCORE.ARPA>
Subject: About this project ...
To: jmc@SU-AI.ARPA
cc: ashok@SU-SCORE.ARPA
Date: 14 Aug 84 1145 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: S1 & NCC
jmc - One of the reasons why Stanford is a great university is that a few
people can think about how one could make an operating system better than
Unix, WAITS and TOPS-20. Anyone interested in taking part in a project
to develop an editor-based operating system written in Common Lisp is
invited to communicate with me.
-------------------------------------------------------------------
I'd welcome more information about this project. I have a programming
project to do anyway.
--ashok
-------
∂14-Aug-84 1501 MRC@SU-SCORE.ARPA other OS's
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 15:00:58 PDT
Date: Tue 14 Aug 84 14:59:14-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: other OS's
To: JMC@SU-AI.ARPA
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 968-1052 (residence)
In fact, I have committed myself to work on an operating system which
will, by intention, replace TOPS-20, Unix, and WAITS. If you bother
to ask, you will find that TOPS-20 people are in general quite open
to the idea of a new operating system, as long as it has the features
of TOPS-20 that are known and loved. It is people in the Unix camp
who seem unwilling to believe there could be something better.
Personally, I feel that "operating system" should be distinguished from
"device driver/interrupt handlers" and "resource allocators".
-------
∂14-Aug-84 1509 VAL
Please look at the solution to the problem you gave me in file "lights".
∂14-Aug-84 1950 ASHOK@SU-SCORE.ARPA Re: editor based operating system
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 19:50:30 PDT
Date: Tue 14 Aug 84 19:49:01-PDT
From: Ashok Subramanian <ashok@SU-SCORE.ARPA>
Subject: Re: editor based operating system
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 14 Aug 84 14:15:00-PDT
Yes, it does look like a major time investment, and I'm not
absolutely sure I could do that. But I'd still like to keep abreast of what's
going on.
--ashok
-------
∂14-Aug-84 2227 DT50@CMU-CS-A.ARPA Re: Gentle introduction
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 14 Aug 84 22:27:21 PDT
Date: 15 Aug 84 0120 EDT
From: Dave.Touretzky@CMU-CS-A.ARPA
To: John McCarthy <JMC@SU-AI.ARPA>
Subject: Re: Gentle introduction
CC: Dave Touretzky@CMU-CS-A.ARPA
In-Reply-To: "John McCarthy's message of 14 Aug 84 15:26-EST"
Thanks very much for your rapid reply, and for your thoughtful comments. I
look forward to including your suggestions in the next edition.
Kindest regards,
Dave Touretzky
∂15-Aug-84 0900 JMC*
Williams about Houston
∂15-Aug-84 0900 JMC*
hp110
∂15-Aug-84 1002 HANSON@SRI-AI.ARPA An operating system better than Unix...
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 10:02:32 PDT
Date: Wed 15 Aug 84 10:01:59-PDT
From: Andy Hanson <HANSON@SRI-AI.ARPA>
Subject: An operating system better than Unix...
To: jmc@SU-AI.ARPA
I am intrigued by your note about making better operating systems
on the SU-BBOARD. (We have seen each other in the halls here at SRI
but I don't think we have spoken before.) This is a favorite subject
of mine that I have tried to think about from time to time - having
a whole list of gripes about UNIX, VMS, TOPS-20 and the Lisp Machine
approach to an operating system, I have some definite ideas about what
a better system should include. Heaven forbid we should be stuck with
UNIX...
While I am pretty heavily tied up with research in the perception
and vision area here, I would be quite interested in participating in
discussions and message exchanges about designing a state-of-the-art
operating system. If such participation would be useful, please include
me on your list of people to whom notices and discussions should be sent.
Andy Hanson HANSON@SRI-AI 415-859-4395
-------
∂15-Aug-84 1036 CLT jmctst
∂15-Aug-84 0142 JMC jmctst
jmctst[b2,jmc] presently contains my draft of the first section of chapter 1.
I've forgotten how to TEX it. Does it need LATEX, or will your current
set of macros work? I'd like to take a copy with me to L.A. to tinker with
on the airplane.
to tex jmctst
(1) make sure you are aliased to b2,jmc
(2) .do l
(3) ansewer jmctst to the f = prompt
(4) if you use / for divides any where mathematically, you should replace it
by \div which will cause the / symbol to appear
∂15-Aug-84 1051 SAMUEL@SU-SCORE.ARPA Re: S1 & NCC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 10:51:14 PDT
Date: Wed 15 Aug 84 10:49:49-PDT
From: Sam Hahn <Samuel@SU-SCORE.ARPA>
Subject: Re: S1 & NCC
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 14 Aug 84 11:45:00-PDT
I have meager resources to offer, but would be interested in such an
effort.
-- sam hahn
-------
∂15-Aug-84 1053 KASHTAN@SRI-AI.ARPA re: S1 & NCC
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 10:53:20 PDT
Date: Wed 15 Aug 84 10:52:26-PDT
From: KASHTAN@SRI-AI.ARPA
Subject: re: S1 & NCC
To: jmc@SU-AI.ARPA
I don't know how much free time I have for such things, but if there is
anything I can do to help please let me know.
David
-------
∂15-Aug-84 1120 DFH C. Hurd
Cuthbert Hurd called, he would like to get together with you for a couple of
hours sometime Thursday or Friday other than at noon.
∂15-Aug-84 1158 FEIGENBAUM@SUMEX-AIM.ARPA need to talk
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 11:57:57 PDT
Date: Wed 15 Aug 84 11:57:49-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: need to talk
To: jmc@SU-AI.ARPA
John, where are you? I need to talk with you about Dick Gabriel and your
views on the structure of continuing work between us and Dick. We met this morning and had a long conversation about it. He's very valuable to our project
and is willing to puyt in 10% to 25 % of his time, but I'm trying to
explore for the appropriate mechanism.
Would appreciate it if you would call me to discuss this.
493-5618 (mostly) or 497-4878
Ed
-------
∂15-Aug-84 1515 GLB
Have you decided about TAing CS206 this Fall?
yes, I accept to do it. Thank you for considering me.
∂15-Aug-84 1717 CL.BOYER@UTEXAS-20.ARPA Re: S1 & NCC
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 17:17:09 PDT
Date: Wed 15 Aug 84 19:16:36-CDT
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: Re: S1 & NCC
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 14 Aug 84 11:45:00-CDT
Texas is a pretty long distance from Stanford, but I think
the idea of working on an operating system with you is
really interesting. If you set up some sort of distribution
list, please include me. Perhaps a remote contribution is
feasible. A principal objective of mine is to produce some
sort of a reliable system, mechanically verified from top to
bottom.
Aside from theorem-proving, Moore and I have had a
significant amount of experience writing text editors,
compilers, and user interfaces. We've not yet had much
experience with processes, context switching, etc.
-------
∂15-Aug-84 2143 RPG
yeah, but someone seriously proposed it, so I felt I had to pass it on.
∂16-Aug-84 0126 ARK Do you have the answer to this...thanks.
∂15-Aug-84 1224 mogul@su-shasta.arpa can you track this down for me?
Received: from SU-SHASTA.ARPA by SU-AI.ARPA with TCP; 15 Aug 84 12:24:30 PDT
Date: Wednesday, 15 Aug 1984 12:21-PDT
To: ark at Sail <ark@Sail>
Subject: can you track this down for me?
From: Jeff Mogul <mogul@Shasta>
I know there's a copy of Eliza/Doctor someplace at Sail, but I don't know
where. Do you?
Thanks
-Jeff
------- Forwarded Message
Received: from sun by Shasta with UUCP; Tue, 14 Aug 84 17:41 PDT
Received: from l5.sun.uucp by sun.uucp (1.2/SMI-1.2)
id AA02229; Tue, 14 Aug 84 17:15:38 pdt
Return-Path: <gnu@l5>
Received: by l5.sun.uucp (1.2/SMI-1.2)
id AA14968; Tue, 14 Aug 84 17:18:36 pdt
Date: Tue, 14 Aug 84 17:18:36 pdt
Message-Id: <8408150018.AA14968@l5.sun.uucp>
From: sun!l5!gnu (John Gilmore)
Subject: Eliza program and "Doctor" script
To: Shasta!mogul
Hi Jeff, my brother is looking for a copy of the original (or modified)
Eliza program and script. Is there a copy lying around at Stanford
that you can mail me?
Thanks...
------- End of Forwarded Message
∂16-Aug-84 0235 LLW@S1-A.ARPA Advice By Phone?
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 02:35:45 PDT
Date: 16 Aug 84 0232 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Advice By Phone?
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂13-Aug-84 2209 JMC@SU-AI.ARPA advice
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 13 Aug 84 22:08:55 PDT
Date: 13 Aug 84 2206 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: advice
To: llw@S1-A.ARPA
I will hope to be able to get your advice between the time they call me
and the time of the interview. Thanks for your help and the offer.
[John: I may be out of town all next week, starting Saturday AM. Perhaps
we can talk tomorrow evening by phone? Lowell]
∂16-Aug-84 0843 DFH Sarah's mail.
John, When you come in to the office today, would you please bring any mail which
may have arrived for me? Thank you.
∂16-Aug-84 0850 AAAI-OFFICE@SUMEX-AIM.ARPA Re: another goof
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 08:48:20 PDT
Date: Thu 16 Aug 84 08:48:16-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Re: another goof
To: JMC@SU-AI.ARPA
cc: AAAI-OFFICE@SUMEX-AIM.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 11 Aug 84 10:42:00-PDT
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
I had the PAC people tape your talk on a cassettee. So, when
I get the copies, I'll send one to you.
Claudia
-------
∂16-Aug-84 0933 HOBBS@SRI-AI.ARPA Meeting Reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 09:33:48 PDT
Date: Thu 16 Aug 84 09:33:08-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting Reminder
To: commonsense.people: ;
General meeting of Commonsense Summer this morning at 10 in EK242.
-- Jerry
-------
∂16-Aug-84 1056 CLT
how about dinner with francoise and gerrard saturday night?
∂16-Aug-84 1135 DFH S.J. Mercury reporter
Peter McCormick of the S.J. Mercury called. He wishes to speak to you as soon
possible about the "appeal for Sakarov's release".I didn't give him any indication
that I did or didn't know what he was talking about, because I thought it might
still ba a confidential matter. Please call this guy at 964-4954.
∂16-Aug-84 1500 DAVIES@SU-SIERRA.ARPA Meeting?
Received: from SU-SIERRA.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 14:54:49 PDT
Date: Thu, 16 Aug 1984 14:53 PDT
Message-ID: <DAVIES.12039988668.BABYL@SU-SIERRA.ARPA>
From: DAVIES@SU-SIERRA.ARPA
To: JMC@SAIL
Subject: Meeting?
cc: Davies@SU-SIERRA.ARPA
Starting this summer, I am the Texas Instruments representative to the
Center for Integrated Systems. I'll be at Stanford for two years
to keep TI informed about Stanford projects, to let Stanford people
know what's going on at TI, and to do some research.
We met briefly during recent visit to TI this spring. I gave you a
short presentation about automating seismic data interpretation,
including some Lisp Machine demonstrations. At Stanford, I'm looking
at two areas: highly parallel architectures, particularly for signal
interpretation, and symbolic computing in VLSI design.
I'm hoping to find out more about your interests in parallel
architectures, including your work with QLAMBDA and implementations of
Lisp on parallel hardware.
If you can spare some time tomorrow afternoon or next week, please let
me know by return mail.
-- Byron (x7-3692)
∂16-Aug-84 1505 CLT
clttex.doc[tex,clt]
∂16-Aug-84 1521 ATP.BLEDSOE@UTEXAS-20.ARPA Bonuses
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 15:20:21 PDT
Date: Thu 16 Aug 84 14:39:24-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Bonuses
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@PARC-MAXC.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
I am pleased that we were able to give Claudia a $5000. Bonus. She worked
so hard and more importantly the meeting went so well that she deserves
it.
The question has arised about a possible bonus for Rich Fikes who has
also worked very hard this year as Secretary/treasurer. Normally I
am opposed to giving perks to professionals who serve the Association,
especially elected officials. But we might want to make an exception
for this particular office, which is long on service and low on
credit. I'd like your reactions.
Woody
-------
∂16-Aug-84 1754 GEORGEFF@SRI-AI.ARPA Workshop timetable
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 17:54:14 PDT
Date: Thu 16 Aug 84 17:52:25-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Workshop timetable
To: lamport@SRI-CSL.ARPA, pratt@SU-AI.ARPA, jmc@SU-AI.ARPA,
waldinger@SRI-AI.ARPA, stan@SRI-AI.ARPA, goguen@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, Edmund.Clarke@CMU-CS-A.ARPA,
BARWISE@SU-CSLI.ARPA, wol@SU-AI.ARPA, MISRA@SU-SIERRA.ARPA,
stuart@SRI-AI.ARPA, ahaas@BBNG.ARPA, YOM@SU-AI.ARPA,
HALPERN%ibm-sj.csnet@CSNET-RELAY.ARPA, lansky@SRI-AI.ARPA,
cs.emerson@UTEXAS-20.ARPA, pereira@SRI-AI.ARPA, georgeff@SRI-AI.ARPA
Here is the tentative schedule of talks for the workshop. Talks
marked '*' are 25 minutes, others are 55 minutes (INCLUDING
discussion). This leaves time for coffee breaks, etc. Thursday is a
rather tough day, but it was the best I could do.
Michael Georgeff.
-----------------------------------------------------------------
Wednesday 1:00 - 5:00 Overviews
--------------------------------
Georgeff (Introduction)
Lamport (Overview of Temporal Logics)
Waldinger (The Frame Problem)
Winskel (Categories of Models for Concurrency)
Wednesday 7:00 - 9:00 (Reasoning about Actions)
-----------------------------------------------
Moore (A Formal Theory of Knowledge and Action)
McCarthy (Axioms for Cooperation and for Concurrent Action)
Thursday 8:30 - 12:30 (Verification and Synthesis of Systems)
--------------------------------------------------------------
Clarke (Automatic Verification of Finite State Concurrent Systems)
Emerson (Modalities for Model Checking) *
Haas (Planning in a Changing World)
Georgeff (A Theory of Action) *
Stuart (Multiagent Planning) *
Lansky (Behavioural Representation of Concurrent Activity) *
Thursday 1:30 - 5:30 (Formalisms for Concurrency)
-------------------------------------------------
Pnueli (A Compositional Temporal Logic)
Wolper (Temporal Logic and Finite Automata)
Pratt (The Pomset Model of Parallel Computation)
Plotkin (?)
Friday 9:00 - 12:00 (Theories of Knowledge and Communication)
--------------------------------------------------------------
Moses (Knowledge and Common Knowledge in Distributed Systems)
Halpern (A Model-Theoretic Analysis of Knowledge)
Cohen (Communicative Acts as Summaries of Shared Plans)
Friday 1:00 - 5:00 (Variations on Standard Approaches)
------------------
Harel (Statecharts: A Visual Approach to Complex Systems)
Misra (Multilevel Synchronization)
Rosenschein (The Flow of Information in Physical Systems)
Everyone (Future Directions)
-------
∂16-Aug-84 1806 LLW@S1-A.ARPA Discussion This Evening
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 18:06:16 PDT
Date: 16 Aug 84 1801 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: Discussion This Evening
To: jmc@SU-AI.ARPA
CC: LLW@S1-A.ARPA
∂16-Aug-84 0925 JMC@SU-AI.ARPA advice
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 16 Aug 84 09:25:29 PDT
Date: 16 Aug 84 0929 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
Subject: advice
To: llw@S1-A.ARPA
Any time after 9 this evening would be convenient for me. I'll start
phoning then to you office unless I get a message proposing a more
specific time.
[John: I should be back from dinner by then, and will be waiting for your
call. Lowell]
∂16-Aug-84 1810 GEORGEFF@SRI-AI.ARPA Workshop Abstracts
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 18:08:20 PDT
Date: Thu 16 Aug 84 18:03:23-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Workshop Abstracts
To: lamport@SRI-CSL.ARPA, pratt@SU-AI.ARPA, jmc@SU-AI.ARPA,
waldinger@SRI-AI.ARPA, stan@SRI-AI.ARPA, goguen@SRI-AI.ARPA,
bmoore@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, Edmund.Clarke@CMU-CS-A.ARPA,
BARWISE@SU-CSLI.ARPA, wol@SU-AI.ARPA, MISRA@SU-SIERRA.ARPA,
stuart@SRI-AI.ARPA, ahaas@BBNG.ARPA, YOM@SU-AI.ARPA,
HALPERN%ibm-sj.csnet@CSNET-RELAY.ARPA, lansky@SRI-AI.ARPA,
cs.emerson@UTEXAS-20.ARPA, pereira@SRI-AI.ARPA, georgeff@SRI-AI.ARPA
THE FLOW OF INFORMATION IN PHYSICAL SYSTEMS:
AN ALTERNATIVE TO THE "REPRESENTATIONAL" PARADIGM FOR AI
Stan Rosenschein
Fernando Pereira
Artificial Intelligence Center
SRI International
Menlo Park, California
The dominant paradigm in AI views the connection between an agent's
internal state and the surrounding world as being "representational"
in nature. That is, structures encoded in the states of an agent
carry information about the world in virtue of some denotation
relation between elements of the structure and elements of the world.
This paradigm has been very fruitful, particularly in providing a
framework for rigorous analysis of the content of an information state
and in stimulating the practical development of systems based on the
manipulation of symbolic expressions "representing" facts about the
world in this denotational sense.
As successful as it has been, however, this approach has several
important limitations, especially in modeling how the dynamics of the
world mesh with the dynamics of information states via perception and
communication and how the information an agent possesses varies as a
function of the computational resources available to it. This talk
will describe an alternative to the representational approach which
promises to provide the same analytical rigor while avoiding many of
the problems.
In the new approach, the fundamental concept is the flow of
information through a physical system. This flow is modelled by
characterizing the mutual state dependencies between components of a
"world process" over space and time. The mathematical concepts
involved draw upon elementary ideas from classical automata theory,
lattice theory, and the logic of programs. The model of processes and
information states was chosen to be general enough to cover AI
applications (e.g. intelligent robots) in which the program must be
seen as embedded in real physical environments. Thus, the basic
framework applies to continuous as well as discrete processes and
allows the same analysis of information content to be applied to
physical suprocesses not ordinarily thought of as "computational."
In addition to describing the basic analytic framework, the talk will
present some preliminary ideas on how this framework might be applied
systematically in the design of complex, "intelligent" processes that
perceive and act on their physical environments.
!
MULTILEVEL SYNCHRONIZATION
Jayadev Misra
Department of Computer Science
University of Texas at Austin
Austin, Texas
Decomposing a synchronization problem into multiple layers of
interacting synchronizations is investigated. A generalization of the
distributed dining philosophers problem is presented and solved in
this manner. I am interested in discussions about the applicability
of this technique as a general problem decomposition mechanism and in
domains other than message passing systems.
!
STATECHARTS: A VISUAL APPROACH TO COMPLEX SYSTEMS
David Harel
Department of Applied Mathematics
The Weizmann Institute of Science
Rehovot, Israel
We present a new kind of state/event formalism relevant to the design,
specification, implementation and maintenance of a complex entity,
such as a large highly concurrent multi-computer real-time system. In
contrast with other approaches to managing complex systems the present
one is based exclusively upon a visual tool, the statechart, which is
intended as a clear and flexible description of the system, enabling
modular top-down and bottom-up design. It is recommended that the
statechart description of a system, termed its stratification, be used
as the main lingua franca by the entire spectrum of personnel involved
in the system, and for the duration of its life cycle. The approach
is being extensively used in the design of a state-of-the-art avionics
system in the Israel aircraft industries, and is being implemented as
a user-friendly graphics-dominated environment at a Rehovot-based
company.
!
AUTOMATIC VERIFICATION OF FINITE STATE CONCURRENT SYSTEMS
E. M. Clarke
Department of Computer Science
Carnegie-Mellon University
Pittsburgh, Pennsylvania
We give an efficient procedure for verifying that a finite state
concurrent system meets a specification expressed in a (propositional,
branching-time) temporal logic. Our algorithm has complexity linear
in both the size of the specification and the size of the global state
graph for the concurrent system. We show how this approach can be
adapted to handle fairness and argue that our technique can provide a
practical alternative to manual proof construction or use of a
mechanical theorem prover for verifying many finite state concurrent
systems. We discuss applications involving network protocols and
asynchronous circuits where experimental results show that state
machines with several hundred states can be checked in a matter of
seconds.
!
PLANNING IN A CHANGING WORLD
Andres Haas
Bolt, Beranek & Newmann
Cambridge, Massachusetts
A planning program looks at many possible plans before choosing the
one that the agent will actually execute. Thus planning raises a hard
problem in knowledge representation: to describe events that are
possible, but not actual. Situation calculus solves this problem, but
at a heavy price: it relies on the assumption that every situation
persists until changed by the agent's action, so that the agent is the
sole cause of change.
I present a theory of planning that allows changes not caused by the
agent. In this theory possible worlds replace possible situations.
The effect of an action is not to change the current situation, but
to pick out a subset of the set of possible futures. The theory is
formalized in modal logic, and extended to handle multiple agents and
planning to acquire and use knowledge.
!
TEMPORAL LOGIC AND FINITE AUTOMATA
Pierre Wolper
AT&T Bell Laboratories
Murray Hill, NJ 07974
First, we describe the close relationship that exists between temporal
logic and finite state machines. This relationship is central to
several applications of temporal logic. We describe how it is used
for program synthesis and verification and discuss other possible
applications.
!
KNOWLEDGE AND COMMON KNOWLEDGE IN DISTRIBUTED SYSTEMS
Yoram Moses
Computer Science Department
Stanford University
Stanford, California
By examining some puzzles and paradoxes, we argue that the right way
to understand distributed protocols is by considering how messages
change the state of a system. We present a hierarchy of knowledge
states that a system may be in, and discuss how communication can move
the system's state of knowledge up the hierarchy. Of special interest
is the notion of common knowledge. Common knowledge is an essential
state of knowledge for reaching agreements and coordinating action.
We show that in practical distributed systems, common knowledge is not
attainable. We introduce various relaxations of common knowledge that
are attainable in many cases of interest. We describe in what sense
these notions are appropriate, and discuss their relationship to each
other. We conclude with a discussion of the role of knowledge in a
distributed system.
!
THE POMSET MODEL OF PARALLEL COMPUTATION
Vaughan Pratt
Department of Computer Science
Stanford University
Stanford, California
This talk will be a brief tutorial on the three main layers of the pomset
(partially ordered multiset) model of computation that I have been working
on for the past several years. The basic model is purely temporal. It
extends in two orthogonal directions: generalization of temporal precedence
to any temporal connection that can be modelled with semirings (including
quantitative real time for either upper or lower bounds), and introduction of
spatial notions, permitting communication, networks, and hierarchical
composition.
!
COMMUNICATIVE ACTS AS SUMMARIES OF SHARED PLANS
Philip R. Cohen
Artificial Intelligence Center
SRI International
Menlo Park, California
and
Center for the Study of Language and Information
Stanford University
Stanford, California
People don't merely utter sentences that are true or false; they also
perform communicative actions such as to request, inform, offer, etc.
Any theory of human communication, and very likely, a good theory of
human-robot communication, will require an analysis of how such
actions can be characterized. We observe that communicative actions
are intended to fit into the speaker's and hearer's ongoing plans, and
argue that as such, they can be defined in terms of beliefs about
conversants' shared knowledge of the speaker's and hearer's goals and
the causal consequences of achieving those goals. Unlike other
theories of such acts, in this theory, communicative acts are not
conceptually primitive, but rather amount to theorems that can be
proven about a state-of-affairs. The important point here is that the
definition of, say, a request is {\it derived} from an
independently-motivated theory of action, rather than stipulated.
This has many interesting effects for a theory of communication, some
of which I can go into if there is time.
The primitives employed in the analysis include formal theories of:
belief/knowledge, goals, action, and time. The latter two incorporate
techniques from dynamic logic and temporal logic. However, there are
difficulties in applying techniques developed for reasoning about
programs in reasoning about human action (naturally).
These difficulties will be illustrated, and suggestions for
overcoming them will be solicited.
This work was done jointly with Hector J. Levesque at the Laboratory
for Artificial Intelligence Research, Fairchild Camera and Instrument Corp.
!
A THEORY OF ACTION
Michael Georgeff
Artificial Intelligence Center
SRI International
Menlo Park, California
A theory of action suitable for reasoning about events in multiagent
or dynamically changing environments is presented. A device called a
process model is used to represent the observable behavior of an agent
in performing an action. This model is quite general, allowing
sequencing, selection, nondeterminism, iteration, and parallelism to
be represented. It is shown how this model can be utilized in
synthesizing plans and reasoning about concurrency. In particular,
conditions are derived for determining whether or not concurrent
actions are free from mutual interference. It is also indicated how
this theory provides a basis for understanding and reasoning about
action sentences in both natural and programming languages.
!
THE FRAME PROBLEM
Richard Waldinger
Artificial Intelligence Center
SRI International
Menlo Park, California
One difficulty with any situational-logic approach to planning is the
huge number of ``frame axioms'' necessary merely to state that most
things have nothing to do with each other. These axioms clutter up
the search space with irrelevant consequences. Recent developments in
deductive program synthesis suggest a way to get rid of the frame
axioms.
In this talk we explain:
- Why is it good to have your planner be a theorem prover.
- Why a situational logic is better than these new-fangled
temporal logics.
- How to get rid of those nasty frame axioms.
The speaker does not (in this talk) pretend to know anything about
concurrency, but hopes blindly that situational logic will have
something to do with the subject.
!
BEHAVIORAL REPRESENTATION OF CONCURRENT ACTIVITY
Amy L. Lansky
Artificial Intelligence Center
SRI International
Menlo Park, California
An event-oriented model of concurrent activity (GEM) is presented.
Properties are described in terms of temporal logic restrictions on
the causal, temporal, and structural relationships between events.
This model has been used for describing the behavioral properties
of several language primitives, concurrency algorithms, and code.
It has also been used as a basis for a behavioral proof methodology.
I will discuss how GEM might be used for planning, and some of the
consequences of using event-based (instead of the traditional state-
based) approaches to planning and domain description.
!
A MODEL-THEORETIC ANALYSIS OF KNOWLEDGE
Joseph Halpern
IBM San Jose Research Laboratory
San Jose, California
Understanding knowledge is a fundamental issue in many disciplines.
In compluter science, knowledge arises not only in the obvious
contexts (such as knowledge-based systems), but also in distributed
systems (where the goal is to have each processor "know" something, as
in Byzantine agreement). A general semantic model of knowledge is
introduced, to allow reasoning about such statements such as "He knows
that I know whether or not she knows whether or not it is raining".
This approach more naturally models a state of knowledge than previous
proposals (including Kripke structures). Using this notion of model,
a model theory for knowledge is developed. This theory enables one to
interpret such notions as a "finite amount of inforamtion" and "common
knowledge" in different contexts.
!
OVERVIEW OF TEMPORAL LOGICS IN REASONING ABOUT CONCURRENCY
Leslie Lamport
SRI International
Menlo Park, California
This talk will review various approaches to the verification of
concurrent systems using temporal logics.
!
CATEGORIES OF MODELS FOR CONCURRENCY
Glynn Winskel
Computer Laboratory
University of Cambridge
United Kingdom
Unfortunately at present there is no widely accepted method for
modelling concurrent computations. There is instead a proliferation
of semantics for such processes. There are concrete models like Petri
nets, event structures, synchronisation trees, and labelled transition
systems, which essentially model a process as moving through states as
events occur. There are more abstract models perhaps based on
powerdomains or on some reasonable idea of operational equivalence,
formed with the idea of detecting and proving specific properties of
processes. Other approaches are based on variants of temporal logic
but here too similar choices are faced; there is the question of how
expressive the logic should be and of the underlying model, which of
course will determine those rules of inference which are valid. The
models do not always even agree on the way concurrency should be
represented. Models like Petri nets and event structures represent
concurrent activity in terms of causal independence while most other
models simulate concurrency by nondeterministic interleaving of atomic
actions.
I shall talk about techniques for relating different models.
To give the idea, each kind of concrete model (eg Petri nets are
such a model) carries a notion of morphism appropriate to languages
like CCS and CSP. Then useful constructions within the model,
like parallel composition, arise as categorical constructions
accompanied by abstract characterisations.
Relations between two different kinds of models, say nets and
trees, are expressed as an adjunction, between say the category
of nets and the category of trees. Because of the way adjunctions
preserve categorical constructions this gives a smooth translation
between semantics in one model and semantics in another.
An open problem: It is not yet clear how this technique extends
to more abstract models.
!
AXIOMS FOR CO-OPERATION AND FOR CONCURRENT ACTION
John McCarthy
Department of Computer Science
Stanford University
Stanford, California
The object is to give axioms suitable for inclusion in a common sense
database about co-operation and concurrent action. The axiom systems
will be for systems that use circumscription, i.e. they are
open-ended in that many new phenomena can be handled by adding axioms
rather than changing existing ones. However, to draw strong
conclusions, circumscriptions that assume a "standard" model of the
axioms is required. At the time of writing this abstract the material
on co-operation is closer to definite shape than that concerning
concurrent action.
MODALITIES
FOR MODEL CHECKING:
BRANCHING TIME STRIKES BACK
E. Allen EMERSON
Department of Computer Sciences
University of Texas at Austin
In the continuing controversy over whether branching time or linear
time temporal logic is more appropriate for reasoning about concurrent
programs, one argument cited in favor of branching time logic concerns
the complexity of automatic verification for finite state concurrent
programs. The global state graph of such a program can be viewed as a
finite (Kripke) structure, and a model checking algorithm can be given
for determining if a given structure is a model of a specification
expressed in a propositional temporal logic. For the branching time
logic known as CTL (which has basic modalities consisting of a path
quantifier, either A ("for all futures") or E ("for some future"),
followed by a single linear time operator F ("sometime"), G
("always"), X ("nexttime"), or U ("until")), Clarke, Emerson, and
Sistla [CES83] give an algorithm that runs in time linear in the size
of the input structure M as well the length of the specification
formula p; hence, this method is readily mechanizable. In contrast,
the model checking problem formulated for linear temporal logic is
known to be PSPACE-complete. In an effort to deflect this argument
for the superiority of branching time, Lichtenstein and Pnueli [LP84]
suggest that, nonetheless, an efficient - in practice - model checking
algorithm exists for linear time logic as well. They describe an
algorithm for model checking linear temporal specifications that runs
in time exponential in the length of the linear specification but only
quadratic in the size of the structure, and claim that it is the small
polynomial complexity in the size of the structure which really
matters because the specifications are usually short. Because the
branching time approach of [CES83] cannot handle (all types of)
fairness whereas their linear time approach can, they go on to suggest
that linear time logic is at least as good as branching time logic for
model checking and perhaps better.
In this talk, we will argue that branching time logic is always better
than linear time logic for model checking. We show that given any
model checking algorithm for any system of linear time logic (in
particular, for the usual system of linear time logic over F, G, X,
and U) there is a model checking algorithm of the same order of
complexity (in both the structure and formula size) for the
corresponding full branching time logic which trivially subsumes the
linear time logic in expressive power (in particular, for the system
of full branching time logic CTL* with basic modalities consisting of
a path quantifier, either A or E followed by an arbitrary linear time
formula over F, G, X, and U). We demonstrate that handling even
alternating, nested path quantifiers costs (essentially) nothing.
Thus, there is no reason to restrict oneself to linear time logic. Use
instead the corresponding full branching time logic for the same cost.
We also show that, contrary to suggestion, all "practical" types of
fairness can be efficiently handled in an extension to CTL because its
basic modalites are simple. We believe our work provides insight into
the relationship between structural complexity of temporal modalities
and computational complexity of the model checking problem.
This is joint work with Chin-Laung Lei.
A FORMAL THEORY OF KNOWLEDGE AND ACTION
Robert C. Moore
Artficial Intelligence Center
SRI International
Menlo Park, California
It has recently been suggested by Halpern and others that a useful way
to view communication among concurrent processes is an exchange of
information that changes the knowledge states of the processes. In
this talk, we present a formal theory of knowledge and action that was
originally developed to be applied to AI planning problems, but which
may also prove useful in this area. One of the limitations of the
current formalism, however, is that it does not deal with simultaneous
events, so we after presenting the basic ideas of the theory, we will
speculate on how it might be extended to deal with true concurrency.
-------
∂16-Aug-84 1814 GEORGEFF@SRI-AI.ARPA Workshop
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 16 Aug 84 18:14:24 PDT
Date: Thu 16 Aug 84 18:11:48-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Workshop
To: lamport@SRI-CSL.ARPA, pratt@SU-AI.ARPA, jmc@SU-AI.ARPA,
waldinger@SRI-AI.ARPA, stan@SRI-AI.ARPA, bmoore@SRI-AI.ARPA,
pcohen@SRI-AI.ARPA, stuart@SRI-AI.ARPA, YOM@SU-AI.ARPA
We still have not got enough people prepared to offer transport to
Monterey for workshop participants. Anyone willing to give someone a
ride?
Mike.
-------
∂17-Aug-84 0147 Stefik.pa@Xerox.ARPA Re: Bonuses
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 01:46:58 PDT
Received: from Semillon.ms by ArpaGateway.ms ; 17 AUG 84 01:43:09 PDT
Date: 16 Aug 84 18:32 PDT
From: Stefik.pa@XEROX.ARPA
Subject: Re: Bonuses
In-reply-to: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>'s message of
Thu, 16 Aug 84 14:39:24 CDT
To: ATP.Bledsoe@UTEXAS-20.ARPA
cc: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik.PA@XEROX.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA
"Normally I am opposed to giving perks to professionals who serve the
Association, especially elected officials. "
I agree. I think Richard has done a fine job -- and so has Ron
Brachman, with probably many times as many hours invested in behalf of
AAAI and the field at large.
If Secretary/Treasurer is to become a "staff" position instead of an
elected service position, then we should discuss the merits of the
appropriate constitutional changes.
Aside: -- would it be possible to make the AAAI Rules or Constitution
available to Councilors?
Mark
∂17-Aug-84 0713 @MIT-MC:RICH@MIT-OZ Secretary/Treasurer
Received: from MIT-MC.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 07:13:29 PDT
Date: 17 Aug 1984 10:12 EDT (Fri)
Message-ID: <RICH.12040166912.BABYL@MIT-OZ>
From: Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>
To: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Cc: aaai-office@SUMEX-AIM.ARPA, Amarel@RUTGERS.ARPA, Bengelmore@SRI-KL.ARPA,
Bledsoe@UTEXAS-20.ARPA, Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA,
Fikes%usc-ecld@USC-ECL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, KRD@MIT-MC.ARPA, Lerman@SRI-KL.ARPA, Minsky@MIT-MC.ARPA,
Nilsson@SRI-AI.ARPA, PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stan@SRI-AI.ARPA, Stefik@PARC-MAXC.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA
Subject: Secretary/Treasurer
In-reply-to: Msg of 16 Aug 1984 15:39-EDT from Woody Bledsoe <ATP.Bledsoe at UTEXAS-20.ARPA>
I have two thoughts on this matter which I would like to share.
First, re this year and Richard. If those that have worked
directly with Richard feel that recognition of service above
and beyond the call of duty is warranted, I certainly don't
want to discourage it. May I suggest that some indication
of appreciation other than a straight cash gift might be
more suitable in our context -- perhaps something personal,
such as a pair of expensive tickets somewhere, or a canoe,
or something.
Regarding the future of the position. If there really is a
lot of routine work which is not essentially of
executive-level interest, I suggest we use the "bonus money"
to hire a part-time accountant or clerk, to keep the board
position of Secretary/Treasurer to the level of policy
direction only which is compatible with elected/volunteer
status.
Finally, I would like to apologize to the board for my not
being able to attend the first meeting of my term as
Councilor. I am delighted with being given the opportunity
to continue to participate on the board and plan
to take an active part in AAAI affairs for the next three years.
-Chuck.
∂17-Aug-84 0830 JMC*
hurd
∂17-Aug-84 0904 HART@SRI-AI.ARPA Re: Secretary/Treasurer
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 09:04:23 PDT
Date: Fri 17 Aug 84 09:01:49-PDT
From: HART@SRI-AI.ARPA
Subject: Re: Secretary/Treasurer
To: RICH%MIT-OZ@MIT-MC.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA, aaai-office@SUMEX-AIM.ARPA,
Amarel@RUTGERS.ARPA, Bengelmore@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Brachman@SRI-KL.ARPA, Buchanan@SUMEX-AIM.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
Genesereth@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, KRD@MIT-MC.ARPA,
Lerman@SRI-KL.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
PHW@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA, Shortliffe@SUMEX-AIM.ARPA,
Stan@SRI-AI.ARPA, Stefik@PARC-MAXC.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA
In-Reply-To: Message from "Charles Rich <RICH%MIT-OZ@MIT-MC.ARPA>" of Fri 17 Aug 84 10:12:00-PDT
Awarding substantial cash bonuses to elected officials of a non-profit
educational/scientific society establishes, I believe, an unwise
precedent. Our Association benefits from the hard work of many unpaid
voluntee. Recognizing these contributions is a fine idea, but would be
better accomplished by other means-- e.g., instituting one or more
service prizes that would be awarded by a defined procedure, carry a
defined benefit (the IEEE uses medals, which over time have become
very prestigious), and would be widely publicized. Without some such
means, we run the real risk that-- over time-- we will be handing out
varied "bonuses" in an inconsistent, perhaps almost whimsical, fashion
that will give us little to be proud of as an Association.
Peter
-------
∂17-Aug-84 0926 DFH
John, Mary was going to leave an envelope at the house for me. Could you please
bring it, and any mail, to the office when you come? It is very important. Also
I keep getting a "Missing Signal Separator" message whenever I try to PUB
Kowali.1[let,jmc]. I looked at it but did not see any reason for this.
∂17-Aug-84 1027 DFH filing
I have pretty much caught up on the filing, so if you have things from home
that should be filed here, why don't you bring them with you when you come.
∂17-Aug-84 1041 DFH phone calle
Please call John Walecka (213) 826-6581.Re: Dick Gabriel.
∂17-Aug-84 1124 GEORGEFF@SRI-AI.ARPA Workshop travel arrangements
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 11:24:49 PDT
Date: Fri 17 Aug 84 11:24:08-PDT
From: Michael Georgeff <georgeff@SRI-AI.ARPA>
Subject: Workshop travel arrangements
To: jmc@SU-AI.ARPA, bmoore@SRI-AI.ARPA, pcohen@SRI-AI.ARPA, lansky@SRI-AI.ARPA,
konolige@SRI-AI.ARPA
Thankyou all for offering to take participants to the workshop. The best
plan is for us all to meet at the Stanford Park Hotel, 100 El Camino Real,
Menlo Park (between Ravenswood and the Creek, East side of El Camino),
at 8:55 am. Meet in the lobby (hotel check-in desk). We will then
pick up the passengers, a few of us going on to SRI to collect anyone
waiting there. SO, 8:50 at the Stanford Park Hotel on Wednesday, August 22.
Everyone will be required to take at most 2 passengers.
Michael Georgeff.
PS Let me know if these arrangements don't suit you.
-------
∂17-Aug-84 1128 RPG Monterey
To: "@INVITE.DIS[COM,LSP]"@SU-AI.ARPA
All of you have been invited to the DARPA-sponsored meeting which will be
held at the Naval Postgraduate School in Monterey, California, on
September 18 and 19. You will be receiving written invitations from DARPA
along with instructions on where it is and suggestions regarding where to
stay.
Monterey is about a 2-hour drive from San Francisco International Airport.
There are flights to Monterey on several carriers. For those who wish to
drive, go south on US 101 through San Jose and past Gilroy. Take route 156
west. Route 156 intersects US 1 a little north of Monterey. The first
Monterey exit is labelled `Pacific Grove.' The Naval Postgraduate School
is within a mile on the left, although that may not be where the meeting
is held.
I suggest getting there the night before the meeting (Sept 19.).
Bring warm clothes for the evenings - it drops into the 50's every night.
Also, be prepared to eat a lot of seafood.
-rpg-
∂17-Aug-84 1153 NILSSON@SRI-AI.ARPA Re: Bonuses
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 11:53:06 PDT
Date: Fri 17 Aug 84 11:50:51-PDT
From: NILSSON@SRI-AI.ARPA
Subject: Re: Bonuses
To: ATP.Bledsoe@UTEXAS-20.ARPA
cc: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA,
Stan@SRI-AI.ARPA, Shortliffe@SUMEX-AIM.ARPA, Stefik@PARC-MAXC.ARPA,
Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA,
Fikes%usc-ecld@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA,
NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>" of Thu 16 Aug 84 15:19:53-PDT
I agree with the comments on this matter I have seen so far, namely
that service by professionals as officers of a scientific society
ought not to be paid for (nor rewarded, nor appreciated, nor etc.)
by cash. Claudia's case is, of course, entirely different, and we
have a responsibility to the association to make sure that it has
the best employees possible. We would be remiss if we failed to
be competitive on salaries and bonuses for outstanding staff. -Nils
-------
∂17-Aug-84 1412 ullman@diablo
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 14:12:04 PDT
Date: Fri, 17 Aug 84 14:12:08 pdt
From: Jeff Ullman <ullman@diablo>
To: jmc@sail, rpg@sail
I'm thinking seriously of trying to get together a proposal for
an NSF "regional" center for supercomputation, based on an IBM
PR-3 512-processor supercomputer. In addition to IBM
and Stanford, we might include Berkeley, perhaps SRI, as contributors.
Apparently such a proposal should be developed over the next
few months to have the best chances.
Any interest?
I imagine that the "partners" would each have to write some
description of their potential use of the machine.
There would be little or no direct research funding through the
proposal.
∂17-Aug-84 1504 VAL My paper on circumscription
I added a couple of pages at the beginning about applications and left a copy of
the new version in your mailbox. May I ask you to read the new introduction and
tell me whether it's OK? I'm not sure I understand 'applications' well enough to
write about them. What else should I do to make it into a report?
∂17-Aug-84 1634 PW The WAITS Lisp Machine
To: "@SUSER.DIS[1,PW]"
Typing TN IGUANA or TN MT-ST-COAX from a DD on SAIL gets you a real lisp
listener on those respective machines.
∂17-Aug-84 1701 GOLUB@SU-SCORE.ARPA appointment of Perlis
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 17:01:50 PDT
Date: Tue 7 Aug 84 14:28:30-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: appointment of Perlis
To: "CSD Senior Faculty": ;
ReSent-Date: Fri 17 Aug 84 17:00:32-PDT
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: jmc@SU-AI.ARPA
I attach a proposal from the future Dean of Engineering. As you may
know, he has obtained several billets to build up a computer
engineering faculty. He intends to aggressively build up an
undergraduate program. He is very interested in seeing Perlis
appointed as a faculty member here but we only agreed to make Perlis a
consulting professor. Let me hear from you on how you feel about
giving Perlis a more permanent position if a billet can be found.
GENE
---------------
Return-Path: <GIBBONS@SU-SIERRA.ARPA>
Received: from SU-SIERRA.ARPA by SU-SCORE.ARPA with TCP; Mon 6 Aug 84 14:41:23-PDT
Date: Mon 6 Aug 84 14:40:47-PDT
From: James F. Gibbons <GIBBONS@SU-SIERRA.ARPA>
Subject: Perlis
To: golub@SU-SCORE.ARPA, ullman@SU-SCORE.ARPA
Gene and Jeff:
Bill Spencer at Xerox has been talking to me recently, as you may
know, about our (Stanford's) possible interest in having half of Alan
Perlis, at essentially no expense to us except for the billet, of course.
The question is whether CS would spend half a billet on him...I guess the
answer is probably no; and if not, whether we could get a new half billet
through the Provost.
My interest in him is as a broad gauge teacher of computer sciece
for interested, advanced undergraduates. My colleagues in CSL say he is
also a good critic of research though not an active researcher himself
anymore. That fits with what Xerox says about him.
We appoint people like Chape Cutler and Conyers Herring in the Applied
Physics Department after they have finished their careers at Bell Labs,
with only a "senior guidance" role in ongoing research programs. Their
appointment does not create any serious billet question as far as I know.
Since Perlis is 62 or 63, I suspect we could make a similar appointment
for him, especially if Xerox agreed to pay his full salary. I know
he won't come without a regular appointment (not a consulting appointment),
but we might really be able to get that for free.
Assuming no effect on your "real"billet count, would CSD be interested
in such an arrangement?
-------
-------
∂17-Aug-84 2044 ALMQUIST@SU-SCORE.ARPA Re: S1 & NCC
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Aug 84 20:44:34 PDT
Date: Fri 17 Aug 84 20:43:17-PDT
From: Philip Almquist <ALMQUIST@SU-SCORE.ARPA>
Subject: Re: S1 & NCC
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 14 Aug 84 11:45:00-PDT
Just curious: why should an operating system be "editor-based"?
My rather limited experience with systems where the editor was anything
other than a normal user program suggested that was an unfortunate
decision, since people who might otherwise like the operating system
might think the editor was awful. Or did I misunderstand your use of
the term "editor-based"?
Philip
-------
∂17-Aug-84 2100 JMC*
kushner
∂18-Aug-84 1041 BSCOTT@SU-SCORE.ARPA Research Associate Salaries
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Aug 84 10:41:45 PDT
Date: Sat 18 Aug 84 10:40:29-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Research Associate Salaries
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, do you want me to let your research associates know what their salaries
are for 84-85, in your behalf, of course?
Betty
-------
∂18-Aug-84 1116 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Bonuses
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 18 Aug 84 11:15:58 PDT
Date: Sat 18 Aug 84 13:13:28-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Bonuses
To: Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA, Bledsoe@UTEXAS-20.ARPA,
Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA, Bengelmore@SRI-KL.ARPA,
Lerman@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Stefik@PARC-MAXC.ARPA, Tenenbaum@SRI-KL.ARPA,
Walker@SRI-AI.ARPA, PHW@MIT-MC.ARPA, Fikes%usc-ecld@USC-ECL.ARPA,
aaai-office@SUMEX-AIM.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>" of Thu 16 Aug 84 14:39:27-CDT
There seems to be a consensus that we should not pay bonuses to
professional people, and further that if Richard (or the current
secretary/treasure) needs more book-keeping help, then
we should provide it throught Claudia's office. I agree with this
and will abide by it.
Thanks for all of your thoughtful comments.
I will try not to overload you with communications, so (therefore!)
I hope you will continue to answer on important issues. I will soon
be appointing AAAI committees in the following areas:
@ Long Range Future of AAAI
@ AAAI Tutorials (Content, organization, lecturers, compensation,
Charge to attendees, etc)
@ AAAI R&D Exhibits (Number, nature, rights of previous exhibitors,
Charges, etc)
@ Program (Number and types of papers, refereeing procedure,
rejection rates, etc)
@ AAAI Research
John McCarthy has been appointed Chairman of this and will
suggest additional committee members. (To promote more
basic research in AI, especially by large companies).
@ Workshops (John McCarthy is the Chairman and sole member).
@ Nonination Committee (Past AAAI Presidents).
@ There might be others
I would appreciate any suggestions that you may have for
membership and chairmanship of these committees. Some
suggestions were made at the Council meeting (August 8) and
otheres have been promised.
Woody
-------
∂20-Aug-84 0818 LCG.CRISPIN@DEC-MARLBORO.ARPA favors
Received: from DEC-MARLBORO.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 08:17:40 PDT
Date: Mon 20 Aug 84 11:18:50-EDT
From: MRC@SU-SCORE.ARPA
Subject: favors
Sender: LCG.CRISPIN@DEC-MARLBORO.ARPA
To: JMC@SU-AI.ARPA, Bosack@SU-SCORE.ARPA
Reply-To: MRC@SU-SCORE.ARPA
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 968-1052 (residence)
John and Len -
I am helping out Peter Hurley in getting together some memorabilia
from the old days of 36 bits. I would like to ask two favors:
. would it be possible to snarf one of Stanford's PDP-6 Reference Manuals
(the one with the instruction set docs) and donate it to DEC? Neither
Peter nor Susan Porada have one in their collection. There are a few
zillion of them in SU's collection. I have one in my personal collection,
but it came from MIT...
. would it be possible to borrow some of the other PDP-6 manuals lying
around SU for exhibition purposes? I am willing to take full
responsibility for their return.
. finally, Peter would like slides made of the AI mechanical arm which
was controlled by the PDP-6/10 and pictures of the cart. Just regular
photos would suffice.
. any other historical memorabilia which Stanford would be willing to
let me bring to Anaheim for exhibition would be gratefully appreciated.
I will be bringing a number of goodies from my personal collection (e.g.
a 6205 board). Random docs and bits of hardware of historical
significance would be fine.
Please don't go to any great trouble for this. There is quite a
collection already, and my own goodies are quite enough. The most
important things are the arm and cart photos. I'm sure HPM took some and
they are someplace???
-- Mark --
-------
∂20-Aug-84 0839 DFH
When you come to the office could you please bring the pendaflex file labeled
"jobs" which is lying on my bed? Thanx.
∂20-Aug-84 0909 GOLUB@SU-SCORE.ARPA Library Keys
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 09:09:23 PDT
Mail-From: LIBRARY created at 20-Aug-84 08:23:19
Date: Mon 20 Aug 84 08:23:19-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: Library Keys
To: golub@SU-SCORE.ARPA
ReSent-Date: Mon 20 Aug 84 09:08:04-PDT
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: jmc@SU-AI.ARPA
Gene,
Since you made the request the library has had an additional request from
another department, all of these requests are being documented and sent
to the library committee. The Library committee will have to meet to
discuss this and with people in and out of town it is a little difficult.
However I hope the library committee will be able to meet and make a
recommendation before the end of September.
Harry
-------
∂20-Aug-84 0922 DFH Appointment Wed.
A fellow named Byron Davies called and wanted an appointment with you Tues. Aug 21
at 2pm.He is the new Texas Instuments rep., Center for Integrated Systems. I told
him I would call him back if there was a problem.(ex 3692,Davies at Sierra).
∂20-Aug-84 0930 GOLUB@SU-SCORE.ARPA Lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 09:30:18 PDT
Date: Mon 20 Aug 84 09:28:52-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Lunch
To: spencer@PARC-MAXC.ARPA
cc: jmc@SU-AI.ARPA
John McCarthy would like to meet with us but he'll be out of town.
Jeff Ullman cann't make it either but Don Knuth is available.
Perhaps we can pospone our lunch for a couple of weeks. Is that
agreeable?
Hope you had a good vacation, GENE
-------
∂20-Aug-84 0932 GOLUB@SU-SCORE.ARPA Papers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 09:32:20 PDT
Date: Mon 20 Aug 84 09:30:35-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Papers
To: tob@SU-AI.ARPA
Tom!
Have you had a chance to work on the papers for Gabriel's promotion?
If you are too busy, let me know and I'll take care of it.
GENE
-------
∂20-Aug-84 0949 MCDERMOTT@YALE.ARPA Re: "non-monotonic"
Received: from YALE.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 09:49:44 PDT
Received: by YALE-BULLDOG.YALE.ARPA; 20 Aug 84 12:37:23 EDT (Mon)
Message-Id: <8408201637.AA16637@YALE-BULLDOG.YALE.ARPA>
Date: Mon, 20 Aug 84 12:13:16 EDT
From: Drew McDermott <Mcdermott@YALE.ARPA>
Subject: Re: "non-monotonic"
To: John McCarthy <JMC@SU-AI.ARPA>
In-Reply-To: John McCarthy <JMC@SU-AI.ARPA>, 12 Aug 84 1606 PDT
I started using "non-monotonic" in 1977, but I was clearly copying Marvin
Minsky, who was copying Vaughn Pratt (according to Pratt). That is,
either Vaughn or Marvin applied the term "monotonic" to classical logic
first, and one of the three of us tacked "non" on the front.
My phone number is (203)436-0606.
-------
∂20-Aug-84 1000 JMC*
French trip
∂20-Aug-84 1018 GOLUB@SU-SCORE.ARPA Re: Promotion papers
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 10:17:56 PDT
Mail-From: BSCOTT created at 20-Aug-84 10:15:20
Date: Mon 20 Aug 84 10:15:20-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: Promotion papers
To: GOLUB@SU-SCORE.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "Gene Golub <GOLUB@SU-SCORE.ARPA>" of Mon 20 Aug 84 09:33:26-PDT
ReSent-Date: Mon 20 Aug 84 10:16:36-PDT
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: jmc@SU-AI.ARPA
Gene, Dick Gabriel has been a Senior Research Associate since April. He's
John McCarthy's research associate.
Betty
-------
∂20-Aug-84 1120 perlis@maryland AIWEEK
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 11:20:31 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA17870; Mon, 20 Aug 84 14:16:51 edt
Date: Mon, 20 Aug 84 14:16:51 edt
From: perlis@maryland (Don Perlis)
Message-Id: <8408201816.AA17870@maryland.ARPA>
To: barwise%su-csli.arpa@csnet-relay,
decvax!watmath!mhvanemden%berkeley@csnet-relay,
henschen%anl-mcs.arpa@csnet-relay, jmc%su-ai.arpa@csnet-relay,
reiter%ubc.csnet@csnet-relay
Subject: AIWEEK
Cc: barwise@su-csli.ARPA, jmc@su-ai
Dear Jon, Larry, John, Ray and Maarten,
I am filling in for Jack while he is away. Below are abstracts
for three of the five invited lectures. If yours is not among
them, please send it as soon as possible. Also, we now have so-
cial security numbers (or equivalents) for Larry, Maarten, and
Ray. John and Jon, please send me your social security numbers so
that we can expedite your honoraria. For Maarten and Ray, spe-
cial forms will be sent that you should fill out as non-U.S. ci-
tizens. Finally, Prof. Osborne of the Math Dept needs a letter
of acceptance from each participant in the WEEK, before honoraria
checks can be printed--a single sentence will do; if you have not
already done so, please send such a letter to Osborne. We have
asked the Math Department to make reservations for all of you for
the evenings of October 21, 22, 23, 24 and 25, except for John
for whom we have reserved a room for October 21, 22, and 23.
Compiling Constraint-checking Programs in Deductive Databases
L. J. Henschen
Abstract
There are at least two kinds of formulas in the intensional database
which should always be satisfied by the interpretations
corresponding to the various states of the database -- definitions
and integrity constraints. In our approach, formulas defining new
relations are used in response to queries to compute portions of
those defined relations; such formulas are therefore automatically
satisfied by the underlying database state. On the other hand,
integrity constraints may need to be checked each time the database
changes. Of course, we believe there are significant advantages in
being able to express integrity constraints in a non-procedural way,
such as with first-order logic. However, reevaluating an entire
first-order statement would be wasteful as normally only a small
portion of the database needs to be checked. We present
(resolution-based) techniques for developing from the first- order
statements efficient tests for classes of updates. These tests can
be developed at database creation time, hence are compiled, and can
be applied before a proposed update is made so that failure does not
require backing out.
LOGIC FOR SPECIFICATION: DATABASES, CONCEPTUAL MODELS AND KNOWLEDGE
REPRESENTATION LANGUAGES
Raymond Reiter
Department of Computer Science
University of British Columbia
and
Canadian Institute for Advanced Research
ABSTRACT
AI systems and databases have a feature in common: they require
representations (italics) for various aspects of the real world.
These representations are meant to be queried and, in response to
new information about the world, modified in suitable ways.
Typically, these query and modification processes require reasoning
using the underlying representation of the world as premises. So,
it appears natural to use a suitable logical language for
representing the relevant features of the world, and proof theory
for the reasoning.
This is not the normal practise in databases and AI. The
representations used (italics) assume a variety of forms, usually
bearing little or no resemblance to logic. In AI examples of
such representation systems (italics, both words) include: semantic
networks, expert systems, and many different knowledge
representation languages such as KRL, KL-ONE, FRL. In databases,
example representation systems are the relational data model, and
various conceptual or semantic models like TAXIS and the
entity-relationship model. The point of these representation
systems is that they provide their users with computationally
efficient ways of representing, structuring and using the knowledge
about an application domain.
The natural role of logic in databases and AI is as a language
for specify- ing representation systems. On this view, one must
distinguish between the abstract specification (italics), using
logic, of the knowledge content of a database or AI application, and
its realization (italics) as a representation system. This
distinction has pleasant consequences:
1.The logical specification provides a rigorous semantics for the
representation system realizing the specification.
2.One can prove the correctness of representation systems with
respect to their logical semantics.
3.By taking seriously the problem of logically specifying an
application, one discovers some rich and fascinating
epistemological issues e.g. the centrality of non-monotonic
reasoning for representation systems.
Strict and Lax Interpretations of Rules in Logic Programming
by
Maarten Van Emden
ABSTRACT
The strict interpretation says only that is admitted
which is explicitly allowed by a rule. The lax interpreta-
tion says only that is excluded which is explicitly disal-
lowed. This distinction is important in mathematics and in
law, for example. Logic programs also are susceptible to
both interpretations. We discuss the use of fixpoint tech-
niques to determine Herbrand models of logic programs. We
find that least fixpoints and least models correspond to the
strict interpretation and characterize successful finite
computations of logic programs. Greatest fixpoints and
greatest models correspond to the lax interpretation and are
closely related to negations inferred by finite failure and
to terms constructed by certain infinite computations.
--Don Perlis
∂20-Aug-84 1122 NILSSON@SRI-AI.ARPA Error
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 11:22:41 PDT
Date: Mon 20 Aug 84 10:51:36-PDT
From: NILSSON@SRI-AI.ARPA
Subject: Error
To: genesereth@SUMEX-AIM.ARPA, grosof@SU-AI.ARPA, jmc@SU-AI.ARPA
cc: nilsson@SRI-AI.ARPA
Generalized Predicate Completion is NOT entailed by Circumscription!
Vladimir Lifschitz has pointed out an error in my note of July 23, 1984.
He also produced a simple (and instructive) counter-example. (Going
back and forth from quantified wffs to clause form led me to mistakenly
distribute universal quantification over a disjunction.) Too bad!
There is probably some weaker result that can be established that
applies to formulas that, while not Horn in P, do not share variables.
(The mistake in my note is in the last paragraph, page 6. The
disjunction of the expressions in (5) is NOT deducible from T in the
form required, namely with each disjunct universally quantified.)
Vladimir and I are getting together this pm to talk some more about
all this.
-Nils
-------
∂20-Aug-84 1147 perlis@maryland.arpa AIWEEK
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 11:47:12 PDT
Received: From Maryland.arpa by csnet-relay; 20 Aug 84 14:21 EDT
Received: by maryland.ARPA (4.12/4.7)
id AA17870; Mon, 20 Aug 84 14:16:51 edt
Date: Mon, 20 Aug 84 14:16:51 edt
From: Don Perlis <perlis@maryland.arpa>
Message-Id: <8408201816.AA17870@maryland.ARPA>
To: barwise%su-csli.arpa@csnet-relay.arpa,
decvax!watmath!mhvanemden%berkeley@csnet-relay.arpa,
henschen%anl-mcs.arpa@csnet-relay.arpa, jmc%su-ai.arpa@csnet-relay.arpa,
reiter%ubc.csnet@csnet-relay.arpa
Subject: AIWEEK
Cc: barwise@su-csli.arpa, jmc@su-ai.arpa
Dear Jon, Larry, John, Ray and Maarten,
I am filling in for Jack while he is away. Below are abstracts
for three of the five invited lectures. If yours is not among
them, please send it as soon as possible. Also, we now have so-
cial security numbers (or equivalents) for Larry, Maarten, and
Ray. John and Jon, please send me your social security numbers so
that we can expedite your honoraria. For Maarten and Ray, spe-
cial forms will be sent that you should fill out as non-U.S. ci-
tizens. Finally, Prof. Osborne of the Math Dept needs a letter
of acceptance from each participant in the WEEK, before honoraria
checks can be printed--a single sentence will do; if you have not
already done so, please send such a letter to Osborne. We have
asked the Math Department to make reservations for all of you for
the evenings of October 21, 22, 23, 24 and 25, except for John
for whom we have reserved a room for October 21, 22, and 23.
Compiling Constraint-checking Programs in Deductive Databases
L. J. Henschen
Abstract
There are at least two kinds of formulas in the intensional database
which should always be satisfied by the interpretations
corresponding to the various states of the database -- definitions
and integrity constraints. In our approach, formulas defining new
relations are used in response to queries to compute portions of
those defined relations; such formulas are therefore automatically
satisfied by the underlying database state. On the other hand,
integrity constraints may need to be checked each time the database
changes. Of course, we believe there are significant advantages in
being able to express integrity constraints in a non-procedural way,
such as with first-order logic. However, reevaluating an entire
first-order statement would be wasteful as normally only a small
portion of the database needs to be checked. We present
(resolution-based) techniques for developing from the first- order
statements efficient tests for classes of updates. These tests can
be developed at database creation time, hence are compiled, and can
be applied before a proposed update is made so that failure does not
require backing out.
LOGIC FOR SPECIFICATION: DATABASES, CONCEPTUAL MODELS AND KNOWLEDGE
REPRESENTATION LANGUAGES
Raymond Reiter
Department of Computer Science
University of British Columbia
and
Canadian Institute for Advanced Research
ABSTRACT
AI systems and databases have a feature in common: they require
representations (italics) for various aspects of the real world.
These representations are meant to be queried and, in response to
new information about the world, modified in suitable ways.
Typically, these query and modification processes require reasoning
using the underlying representation of the world as premises. So,
it appears natural to use a suitable logical language for
representing the relevant features of the world, and proof theory
for the reasoning.
This is not the normal practise in databases and AI. The
representations used (italics) assume a variety of forms, usually
bearing little or no resemblance to logic. In AI examples of
such representation systems (italics, both words) include: semantic
networks, expert systems, and many different knowledge
representation languages such as KRL, KL-ONE, FRL. In databases,
example representation systems are the relational data model, and
various conceptual or semantic models like TAXIS and the
entity-relationship model. The point of these representation
systems is that they provide their users with computationally
efficient ways of representing, structuring and using the knowledge
about an application domain.
The natural role of logic in databases and AI is as a language
for specify- ing representation systems. On this view, one must
distinguish between the abstract specification (italics), using
logic, of the knowledge content of a database or AI application, and
its realization (italics) as a representation system. This
distinction has pleasant consequences:
1.The logical specification provides a rigorous semantics for the
representation system realizing the specification.
2.One can prove the correctness of representation systems with
respect to their logical semantics.
3.By taking seriously the problem of logically specifying an
application, one discovers some rich and fascinating
epistemological issues e.g. the centrality of non-monotonic
reasoning for representation systems.
Strict and Lax Interpretations of Rules in Logic Programming
by
Maarten Van Emden
ABSTRACT
The strict interpretation says only that is admitted
which is explicitly allowed by a rule. The lax interpreta-
tion says only that is excluded which is explicitly disal-
lowed. This distinction is important in mathematics and in
law, for example. Logic programs also are susceptible to
both interpretations. We discuss the use of fixpoint tech-
niques to determine Herbrand models of logic programs. We
find that least fixpoints and least models correspond to the
strict interpretation and characterize successful finite
computations of logic programs. Greatest fixpoints and
greatest models correspond to the lax interpretation and are
closely related to negations inferred by finite failure and
to terms constructed by certain infinite computations.
--Don Perlis
∂20-Aug-84 1155 PW telnet to the 3600s
To: JMC, RPG
I couldn't find a LISPM-INIT file for you on either Coax or Iguana, so the
message was correct. I made mt-st-coax your home host and moved over the
files you had on iguana.
I'm not sure why the connection was reset. Typing (neti:reset) followed by
(neti:enable-services) to lisp on the problem lisp machine usually fixes this.
To kill the link, one simply types CALL. That's about all I know. The telnet
service to the lispm is rudamentary. The only editing capabilities are within
the WAITS line buffer before it is sent across the net. This 3600s seem aware
of the limitations of the connection and don't let you into any display routines.
If I figure out any clever hacks using this, I will pass them on. However, I
don't recommend this as a way to operate the 3600s. I was surprised it worked
at all.
Are computer mail memos sufficient?
∂20-Aug-84 1750 HOBBS@SRI-AI.ARPA Last meeting
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 17:49:50 PDT
Date: Mon 20 Aug 84 17:49:37-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Last meeting
To: commonsense.people: ;
The last meeting of commonsense summer will be Wednesday morning at 10:30
in EK242. We'll discuss Bill Croft's work on determiners and Kathleen
Kells' work on commitment. The relevant files will be on the <commonsense>
directory by tomorrow afternoon under DETERMINER.* and COMMIT.*.
-- Jerry
-------
∂20-Aug-84 1818 PW Common Lisp on the 3600s
To: "@SUSER.DIS[1,PW]"
Both Iguana and Coax have Common Lisp built into the default world-load.
To get to the Common-Lisp-Listener (CL needs its own reader), type
SELECT then SYMBOL-SHIFT-L (λ). When writing and running CL code from
Zmacs files, be sure you are in the appropriate package (ie. CL, COMMON-LISP,
or COMMON-LISP-USER). Common Lisp shadows ZetaLisp which is running concurrently,
so beware of package confusion with symbol names.
This is an old version (February) of Moon's code. Symbolics doesn't support it
yet so don't send bug reports, of which there are plenty, off to them.
It ain't lexical, but it's got characters.
∂20-Aug-84 1901 ATP.BLEDSOE@UTEXAS-20.ARPA Re: workshop on combining AI and numerical computation
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 19:01:05 PDT
Date: Mon 20 Aug 84 21:01:22-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: workshop on combining AI and numerical computation
To: JMC@SU-AI.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sat 18 Aug 84 11:29:00-CDT
Thanks John for the letter on the Workshop. Yes, I am impressed with
DEST - anyway it reminds me of what we were trying to do ages ago.
A very handy device.
-------
∂20-Aug-84 2326 @SRI-AI.ARPA:BRATMAN@SU-CSLI.ARPA reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 20 Aug 84 23:25:53 PDT
Received: from SU-CSLI.ARPA by SRI-AI.ARPA with TCP; Mon 20 Aug 84 23:25:46-PDT
Date: Mon 20 Aug 84 23:17:36-PDT
From: Michael Bratman <BRATMAN@SU-CSLI.ARPA>
Subject: reminder
To: pcohen@SU-CSLI.ARPA, georgeff@SU-CSLI.ARPA, konolige@SU-CSLI.ARPA,
bmoore@SU-CSLI.ARPA, john@SU-CSLI.ARPA, stan@SU-CSLI.ARPA,
zalta@SU-CSLI.ARPA, nissenbaum@SU-CSLI.ARPA
cc: jmc@SRI-AI.ARPA, bmoore@SRI-AI.ARPA, stan@SRI-AI.ARPA, pcohen@SRI-AI.ARPA,
bratman@SU-CSLI.ARPA
REMINDER:
area f-4 meeting to choose our leader
Tuesday, AUgust 21 at 12:30-1:00 in Ventura seminar room.
-------
∂21-Aug-84 0042 talmy%ucbkim@Berkeley debate with Searle
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 00:42:16 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA24484; Mon, 20 Aug 84 21:53:37 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA05252; Mon, 20 Aug 84 21:52:25 pdt
Date: Mon, 20 Aug 84 21:52:25 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8408210452.AA05252@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: debate with Searle
Cc: talmy%ucbkim@Berkeley
John--
John Searle said he would enjoy a discourse/debate with you on the
1st/3rd person issue, and Sept. 4 would be fine. So, I'll now
officially schedule you both for
Tuesday, September 4, 11am-2pm, 240 Bechtel
and will have an announcement for this sent around. As the date
approaches, I'll send you directions on where to drive onto campus (the
guard will have your name) so you can park.
But I have one more thing in mind. Jerry Hobbs will be giving us a talk
on Commonsense Summer later in September or early October. I think it
would be good if you could give us your AAAI address on common sense on the
Tuesday preceding this, so that something of a two-week theme can be set up
for the Berkeley audience. Is there any chance you'd be interested in
coming to Berkeley a second time in September? If so, the best dates
would be the 18th or the 25th, although the 11th is also okay (Jerry
says his schedule is flexible enough to accommodate following any of these).
Our format here is: the main talk from 11am to 12:30 in 240 Bechtel and
then, after a brief lunch break, a question/interaction period (or else
further presentation of points left out of the main talk) till 2pm in
building T-4. If you thought your common sense material might not
cover this amount of time, you'd be welcome to incorporate other
matters of interest to you. What do you think of this idea?
--Len Talmy
∂21-Aug-84 0846 TWALKER@SRI-AI.ARPA "Farewell Luncheon" for "COMMONSENSE STUDENTS"
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 08:46:11 PDT
Date: Tue 21 Aug 84 08:45:13-PDT
From: TWALKER@SRI-AI.ARPA
Subject: "Farewell Luncheon" for "COMMONSENSE STUDENTS"
To: aic-staff@SRI-AI.ARPA,
commonsense.people: ;
cc: twalker@SRI-AI.ARPA
DATE: August 27th (next Monday)
TIME: 12:00 noon
PLACE: "KIYOSHI" Restaurant
1328 El Camino
Menlo Park
If you are planning to attend, please let me know by Friday, 8/24.
Thanks,
Tonita (x2641)
-------
∂21-Aug-84 0919 MULLEN@SUMEX-AIM.ARPA SIGLUNCH--This week there will be a RIPLUNCH-Friday, Aug.24, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 09:19:46 PDT
Date: Tue 21 Aug 84 09:17:27-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: SIGLUNCH--This week there will be a RIPLUNCH-Friday, Aug.24, 1984
To: siglunch@SUMEX-AIM.ARPA
RIPLUNCH
DATE: Friday, August 24, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
SPEAKER: Larry Fagan, Joan Differding, and Mark Musen
Medical Computer Science Group
TOPIC OPAL: Practical Knowledge Acquisition for ONCOCIN
ABSTRACT:
We will discuss our design of the ONCOCIN knowledge acquisition
framework named OPAL. ONCOCIN is designed to assist physicians with
the management of cancer treatment plans. A number of these treatment
plans, called protocols, have been entered into the ONCOCIN system
using low level tools. We have recently built a protocol oriented
knowledge acquisition system designed directly for the cancer
specialist (oncologist). The OPAL knowledge acquisition subsystem is
graphically based and represents our analysis of the common components
of cancer treatment plans.
-------
∂21-Aug-84 1402 TWALKER@SRI-AI.ARPA "New Location" for FAREWELL LUNCHEON
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 14:02:22 PDT
Date: Tue 21 Aug 84 14:00:55-PDT
From: TWALKER@SRI-AI.ARPA
Subject: "New Location" for FAREWELL LUNCHEON
To: aic-staff@SRI-AI.ARPA,
commonsense.people: ;
cc: twalker@SRI-AI.ARPA
PLACE: "Yuen Yung" Restaurant
639 Santa Cruz Avenue
Menlo Park
TIME: 12:00 Noon
Thanks,
Tonita
P.S. Again, if you are planning to attend, please let me know by Friday, 8/24
(if you haven't done so already)
-------
∂21-Aug-84 1437 greep@SU-DSN Editor as top-level
Received: from SU-DSN.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 14:36:45 PDT
From: Steven Tepper <greep@SU-DSN>
Received: from by SU-DSN with TCP; Tue, 21 Aug 84 14:35:19 pdt
Date: 21 Aug 84 14:35:12 PDT (Tue)
To: JMC@su-ai
Cc: greep@SU-DSN
Subject: Editor as top-level
Our discussion about having an editor as the top-level user interface to a
system led me to consider a generalization of the topic -- getting data
into and out of a program. First let me give an analogy to illustrate the
motivation for this idea.
In the early days of computers, programs that wanted to talk to I/O devices
had to handle the low-level details. Later on, operating systems took over
this function, thus making it possible (1) for the same program to talk to
different kinds of devices or to files, and (2) to run the same program under
different operating systems.
It seems that programs are now in somewhat the same state of anarchy with
respect to user input/output as they used to be with respect to low-level
device I/O, in that the particular method of communicating with the user
is highly dependent on the system for which the program is written. For
example, Unix programs are generally non-interactive (except for text
editors), and expect all options to be specified on the command line along
with the name of the program. On OS/360, options are expressed in job
control language. On Twenex, some programs take options on the command
line while others query the user and wait for a response. Even worse, some
programs assume particular properties of the user's terminal (such as
number of columns or lines) or even a particular model of terminal.
There are advantages and disadvantages to the various ways of getting data
from the user. The interactive mode saves the user from having to remember
a lot of options, but may query him on items which he would just as soon
leave to the default values. On a system like Unix which makes it easy to
run several concurrent processes, two or more processes attempting to talk
to the user at the same time can make a mess of the terminal display unless
there is some kind of interlocking, or another way of separating the various
interactions (eg multiple windows). The "batch" mode has the disadvantage
that the user has to get everything right the first time, or rerun the
entire program. This can be especially annoying if the program has already
undergone a substantial amount of computation before reporting that some
option was incorrectly specified. The batch mode has the advantage of
being more amenable to use in script files which are to be run without a
human present. Of course the batch and interactive modes can be combined
(eg the program can ask the user for more information only if something
goes wrong) with the corresponding advantages and disadvantages of each.
This brings up the idea of a "language" for specifying options to programs.
Some common part of the system could then interpret these specifications
in the context of the particular system, mode of program invocation (eg
batch vs. interactive), and hardware configuration, as opposed to having
each program decide a priori what its user interface should look like.
To give another analogy, in a typesetting system like TeX or Scribe, the
output format is described in functional terms such as paragraphs and
equations rather than in terms of a given output device. The typesetting
commands are then interpreted for various printers by routines specific
to those devices.
The advantages of using such a specification language would be:
1. programs would be more independent of the operating environment, so
that the same program could be run in batch or interactive mode, or in
a combination, or in some other mode I haven't though of. In addition,
2. Programs run interactively would be more independent of particular
hardware, so that they could be run with a tty, mouse-driven menu
system, etc. In addition, new ways of interacting with programs (eg
if a bitmap display is added when none previously existed) can be
accomodated without modifying the programs themselves.
3. If all programs on a given system used this sort of specification,
the overall user interface would relatively uniform, which is by no
means the case on all current systems (Unix programs in particular
suffer from a multitude of conventions for passing options and for
option names).
4. Someone wanting to run a program in unattended batch mode (eg to be run
in the middle of the night) could verify that the options were at
least syntactically correct, just as some programming languages
verify that the data types of the arguments to subroutine calls match
those of the formal parameters.
Other features could be added relatively easily, e.g. messages from programs
could be specified by some identifier rather than as actual text, so that
the text displayed to the user (and the inputs accepted in response) could
be in different languages, assuming the hardware could handle the appropriate
alphabet. (I think the Xerox Star system already does this.)
This is a little far afield from the original discussion of using an
editor to interact with a system, but I would like to pursue the subject
if you have any interest in it.
∂21-Aug-84 1524 sato@SU-Russell Data Media
Received: from SU-RUSSELL.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 15:23:48 PDT
Date: 21 Aug 1984 15:17-PDT
From: Masahiko Sato <sato@SU-Russell>
Subject: Data Media
To: jmc@sail
Message-Id: <84/08/21 1517.610@SU-Russell>
Could you check the availability of a Data Media terminal?
Thank you.
∂21-Aug-84 1548 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA Project F4
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 15:48:39 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Tue 21 Aug 84 15:40:03-PDT
Date: Tue 21 Aug 84 15:47:53-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: Project F4
To: f4@SU-CSLI.ARPA, nissenbaum@SU-CSLI.ARPA, etchemendy@SU-CSLI.ARPA
At today's meeting to discuss who should be project leader for F4
("Thought, Action, and the Commonsense World") I was the slowest in
taking a step backward, so I guess I am it. I am counting on everyone
to make suggestions as to what activities should be carried out or
sponsored by the project.
It was suggested that we pick a regular meeting time for the project.
We could use the time slot for various things--disorganized
discussions, informal presentation of work, or even a regular
seminar--but since we are so spread out physically, it seemed like a
good idea to get together on a regular basis. We can decide what we
want to do with the time at our first meeting. The time that seemed
best to the people who met today was 3:15-5:00 on Tuesdays, but the
same time on Wednesdays also seemed possible. Please let me know
about schedule conflicts. I will be away the last two weeks of
September, so I will tentatively schedule our first meeting for
October 2. (Of course, you are all more than welcome to go ahead
without me.)
Comments, please.
--Bob
-------
∂21-Aug-84 1908 YOM
IBM has agreed to pay my expenses at the PODC conference.
∂21-Aug-84 1928 Brachman@SRI-KL.ARPA Congratulations and thanks
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 19:28:12 PDT
Date: Tue 21 Aug 84 11:09:12-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
Subject: Congratulations and thanks
To: ADavis at SRI-KL at SU-DSN, rgsmith at RUTGERS at SU-DSN,
forbus at BBNG at SU-DSN, buchanan at SUMEX-AIM, mckeown at COLUMBIA-20 at SU-DSN,
wilensky%ucbdali at UCB-VAX at SU-DSN, bledsoe at UTEXAS-20 at SU-DSN,
tilove.gmr at CSNET-RELAY at SU-DSN, lowrance at SRI-AI at SU-DSN,
jmc at SU-AI, rpg at SU-AI, krd at MIT-MC at SU-DSN, malone at MIT-XX at SU-DSN,
stefik at XEROX at SU-DSN, mcdermott at YALE at SU-DSN, nilsson at SRI-AI at SU-DSN,
kehler%usc-ecld at USC-ECL at SU-DSN, carbonell at CMU-CS-C at SU-DSN,
winston at MIT-AI at SU-DSN, mitchell at RUTGERS at SU-DSN
To all AAAI-84 Session Chairs, Panel Organizers, and Panel Chairs:
Thanks! You all did a GREAT job. The conference went unbelievably
smoothly, and you are all to be commended on your important
contributions. I personally very much appreciate all your efforts. The
paper sessions went like clockwork, and the panels were all well
received. Thanks for helping make it a great conference.
Ron
-------
∂21-Aug-84 2242 GOLUB@SU-SCORE.ARPA Re: Lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 21 Aug 84 22:42:03 PDT
Date: Tue 21 Aug 84 22:36:57-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: Lunch
To: Spencer.PA@XEROX.ARPA
cc: jmc@SU-AI.ARPA
In-Reply-To: Message from "Spencer.PA@XEROX.ARPA" of Tue 21 Aug 84 08:21:18-PDT
Sept 11 is fine but Sept 13 is out. So let it be Sept 11 but I must check with
my colleagues.
GENE
-------
∂22-Aug-84 0702 MASON@SU-SCORE.ARPA unification
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 07:01:54 PDT
Date: Wed 22 Aug 84 07:00:36-PDT
From: Ian Mason <MASON@SU-SCORE.ARPA>
Subject: unification
To: clt@SU-AI.ARPA
cc: jmc@SU-AI.ARPA
the following program, if it works(?), is the unification algorithm
i intend to prove properties of. If you dissagree with my choice of
trade off between actual substitution and occurence checking then please
tell me before i launch into the filthy task of proving healthy
properties of this creature & its family.
(defun unify (x y) (uni x y 'nil))
(defun uni (x y a)
(cond ((or (eq a 'no) (eq x y)) a)
((and (isvar x) (assoc x a)) (uni (cdr (assoc x a)) y a))
((and (isvar y) (assoc y a)) (uni x (cdr (assoc y a)) a))
((isvar x) (if (occur x (sublis y a)) 'no (cons (cons x y) a)))
((isvar y) (if (occur y (sublis x a)) 'no (cons (cons y x) a)))
((or (atom x) (atom y)) 'no)
( T (uni (cdr x)
(cdr y)
(uni (car x) (car y) a)))))
(defun occur (x y)
(if (atom y)
(eq x y)
(or (occur x (car y))
(occur x (cdr y))) ) )
(defun sublis (p a)
(if (atom p)
(if (isvar p)
(let ((w (assoc p a))) (if (null w) p (cdr w)))
p)
(cons (sublis (car p) a) (sublis (cdr p) a))))
(defun isvar (x) (memq x '(p1 p2 p3 p4)))
ian.
-------
∂22-Aug-84 0906 HOBBS@SRI-AI.ARPA Meeting reminder
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 09:06:34 PDT
Date: Wed 22 Aug 84 09:06:31-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Meeting reminder
To: commonsense.people: ;
cc: ashok@SU-SCORE.ARPA
Commonsense Summer Meeting today at 10 am in EK242.
-- Jerry
-------
∂22-Aug-84 0917 A.SANDY@SU-GSB-HOW.ARPA Re: DEST
Received: from SU-GSB-HOW.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 09:17:16 PDT
Date: Wed 22 Aug 84 09:15:45-PDT
From: Sandy Lerner <A.SANDY@SU-GSB-HOW.ARPA>
Subject: Re: DEST
To: JMC@SU-AI.ARPA
cc: sandy@SU-GSB-WHY.ARPA, A.SANDY@SU-GSB-HOW.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 21 Aug 84 22:59:00-PDT
Sure... DEST, Inc.
Richard E. Amen, President
(408) 946-7100
2380 Bering Dr.
San Jose, CA 95131
-------
∂22-Aug-84 1005 CLT opera
thu 27 sep 20:00 Carmen SFO
tue 27 nov 20:00 Kovanshchina SFO
∂22-Aug-84 1327 GOGUEN@SRI-AI.ARPA teaching
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 13:27:48 PDT
Date: Wed 22 Aug 84 13:27:58-PDT
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: teaching
To: jmc@SU-AI.ARPA
cc: goguen@SRI-AI.ARPA
john,
i hear that you are in charge of some kind of adjunct professor program
(i probably have the words wrong) whereby people like me might teach a
course at stanford. pepe meseguer and i are writing a book on semantics,
and would be glad of a chance to try it out on some live students; also,
we would like to have more interaction with stanford students, especially
anyone who is interested in theory of computation, programming language
semantics, etc. if there are such opportunities, could you let me know,
then maybe we could get together for lunch, or talk on the phone, or
something.
cheers,
joseph
-------
∂22-Aug-84 1506 CLT
To: JMC, MS
∂22-Aug-84 1502 JMC
To: MS
CC: CLT
You can have the Datamedia terminal in room 362.
CLT -- It is in the secretaries office, not in 362
∂22-Aug-84 1601 CLT
do you have the robinson and ? papers on their
prolog in lisp? I think they did something
interesting with alists that IAN should look at.
Perhaps sarah could find it for him.
∂22-Aug-84 1732 PW 3600s ↔ SAIL
To: "@SUSER.DIS[1,PW]"
File transfers from SAIL to COAX and IGUANA are working.
from SAIL:
One can RETRIEVE single files from the lisp machines. Multiple file transfers die
in the directory listing.
.ftp onefil.lsp ← {iguana}>pw>single-file.lisp
< FTP service ready.
Input complete: 23 bytes transferred (0.0 Kbaud)
Connection has been closed
Exit
↑C
.
One can SEND single or multiple files to the Lisp Machines.
.ftp {iguana}>pw>*.lisp ← *.lsp
< FTP service ready.
Reading ONE.LSP[1,PW]
Output complete: 245 bytes transferred (0.8 Kbaud)
Reading TWO.LSP[1,PW]
Output complete: 23 bytes transferred (0.0 Kbaud)
Reading THREE.LSP[1,PW]
Output complete: 4 bytes transferred (0.0 Kbaud)
Reading FOUR.LSP[1,PW]
Output complete: 58 bytes transferred (0.0 Kbaud)
Connection has been closed
Exit
↑C
.
from the LISPMs
While in ZMACS, one can use meta-X COPY FILE to move single or multiple files.
This command prompts for both source and destination pathnames. Whether as the
source or the destination, the SAIL pathname should look something like
SAIL:onefil.lsp[1,pw] or,
SU-AI:*.lsp[1,pw]
Lisp machine pathnames are as usual.
One can also directly read from (C-X, C-F) and write to (C-X, C-S) SAIL files
while in a ZMACS buffer. The more you can leave on SAIL the better, because
of the limited disk space on the 3600s.
As incentive to learn this stuff, I should point out that the lisp machines are
not backed up regularly.
∂22-Aug-84 1802 GOLUB@SU-SCORE.ARPA Meeting with Spencer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 18:02:25 PDT
Date: Wed 22 Aug 84 18:00:59-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Meeting with Spencer
To: McCarthy@SU-SCORE.ARPA, knuth@SU-SCORE.ARPA, Ullman@SU-SCORE.ARPA
I've cancelled the luncheon with Spencer since Don was the only one
who was available and John wanted to meet with him. I've rescheduled the
lunch for Tuesday, Sept 11. Are you free then?
GENE
-------
∂22-Aug-84 2258 GOLUB@SU-SCORE.ARPA Re: Meeting with Spencer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Aug 84 22:58:22 PDT
Mail-From: ULLMAN created at 22-Aug-84 22:28:05
Date: Wed 22 Aug 84 22:28:05-PDT
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: Re: Meeting with Spencer
To: GOLUB@SU-SCORE.ARPA
In-Reply-To: Message from "Gene Golub <GOLUB@SU-SCORE.ARPA>" of Wed 22 Aug 84 18:01:02-PDT
ReSent-Date: Wed 22 Aug 84 22:57:03-PDT
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: jmc@SU-AI.ARPA
I suppose I'm free on Sept. 11; I'll check when I get back to
my office.
I haven't forgotten about the $10, byt the way; I just don't have
any cash.
-------
∂23-Aug-84 0900 JMC*
info to Taugner
∂23-Aug-84 1012 PACK@SRI-AI.ARPA Kinds
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 23 Aug 84 10:12:12 PDT
Date: Thu 23 Aug 84 10:11:46-PDT
From: Leslie E. Pack <PACK@SRI-AI.ARPA>
Subject: Kinds
To: jmc@SU-AI.ARPA
I have a file (kinds.txt[1,lep]) that contains my current thinkings about
natural and unnatural (man-made) kinds. It might be useful if you were to
read that before we discuss it. I am also interested in pointers to the
literature on this subject. I know about the philosophy literature on
natural kinds, but not of anything on man-made kinds.
-Leslie
-------
∂23-Aug-84 1103 talmy%ucbkim@Berkeley the you/Searle discussion
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 23 Aug 84 11:03:11 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA12361; Thu, 23 Aug 84 11:03:43 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA19903; Thu, 23 Aug 84 11:02:34 pdt
Date: Thu, 23 Aug 84 11:02:34 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8408231802.AA19903@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: the you/Searle discussion
Cc: talmy%ucbkim@Berkeley
Hi--
I forwarded your memo to me over to John Searle. He got back to me
saying:
a) He would like this to be a discussion rather than a debate since he
doesn't feel that the issue is so clearly divided into opposing views (or
perhaps that you two occupy completely opposing views).
He would like a format of each person first presenting his perspective
for 15 minutes (with you, perhaps, going first) and then having a
two-way discussion.
b) He felt that epistemology alone might be too narrow a domain, and
suggested expanding the discussion, and its announced title, to "First
Person and Third Person Points of View in Cognitive Science, Philosophy
of Mind, and Epistemology".
c) Given these changes, he felt that your definition of the question
would no longer be accurate and thought any such definition would be
best dispensed with.
Since your message said that any emendations John might make would be
acceptable with you in advance, I'll just go ahead and institute the
above points. But I wanted to inform you of developments.
--Len
∂23-Aug-84 1807 RINDFLEISCH@SUMEX-AIM.ARPA TI Hardware
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 23 Aug 84 18:07:42 PDT
Date: Thu 23 Aug 84 18:05:47-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: TI Hardware
To: HPP-Exec@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, RPG@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Golub@SU-SCORE.ARPA, Reges@SU-SCORE.ARPA,
Bosack@SU-SCORE.ARPA
John Alden from TI called to follow up the AAAI show and to say they would have
a contingent in the area on Thursday, September 6 (and possible the evening of
9/5 or morning of 9/7) to talk about TI AI hardware at Stanford. They have
offered to send us a PC with "EMYCIN" to play with right away in preparation
for the meeting. They will want to talk about educational uses of the expert
system PC and interest in Lisp machine hardware. I need to know who is
interested/will be here then and we need to figure out what we want to say to
them.
Tom R.
-------
∂23-Aug-84 2215 talmy%ucbkim@Berkeley 2nd talk
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 23 Aug 84 22:15:24 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA02392; Thu, 23 Aug 84 22:14:02 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA25343; Thu, 23 Aug 84 22:15:14 pdt
Date: Thu, 23 Aug 84 22:15:14 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8408240515.AA25343@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: 2nd talk
Cc: talmy%ucbkim@Berkeley
Okay, Sept. 4 is all set, then. For your second appearance (if you are indeed
able to make it), I would appreciate knowing by tomorrow, if at all possible,
whether you can make it on the 11th or, failing that, on the 18th or 25th. I
ask for a response this soon only because I have to concern myself with our
overall scheduling. Thanks. --Len
∂24-Aug-84 0918 GOLUB@SU-SCORE.ARPA lunch
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Aug 84 09:17:58 PDT
Return-Path: <PHY@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Fri 24 Aug 84 07:49:14-PDT
Date: 24 Aug 84 0749 PDT
From: Phyllis Winkler <PHY@SU-AI.ARPA>
Subject: lunch
To: golub@SU-SCORE.ARPA
ReSent-Date: Fri 24 Aug 84 09:16:38-PDT
ReSent-From: Gene Golub <GOLUB@SU-SCORE.ARPA>
ReSent-To: jmc@SU-AI.ARPA
Don Knuth will join you and Spencer for lunch on Tuesday, September 11.
∂24-Aug-84 1039 HOBBS@SRI-AI.ARPA Your thoughts
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 24 Aug 84 10:39:34 PDT
Date: Fri 24 Aug 84 10:38:56-PDT
From: HOBBS@SRI-AI.ARPA
Subject: Your thoughts
To: jmc@SU-AI.ARPA
cc: hobbs@SRI-AI.ARPA
John --
If you have any thoughts about how Commonsense Summer went, how it should
have gone, and what we should do different if we do it again, I would
value hearing about them.
-- Jerry
-------
∂24-Aug-84 1136 ULLMAN@SU-SCORE.ARPA mail troubles
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Aug 84 11:35:56 PDT
Date: Fri 24 Aug 84 11:34:08-PDT
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: mail troubles
To: jmc@SU-AI.ARPA, rpg@SU-AI.ARPA, oliger@SU-NAVAJO.ARPA
I sent each of you mail concerning the IBM ultracomputer offer and
have not heard back. it is possible that your machines do not
know of the change in diablo's logical address that took place on 8/11.
Could I ask you to resend any messages to me at score. Thanks.
-------
∂24-Aug-84 1255 ULLMAN@SU-SCORE.ARPA Re: ultracomputer offer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Aug 84 12:55:07 PDT
Date: Fri 24 Aug 84 12:53:45-PDT
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: Re: ultracomputer offer
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 24 Aug 84 12:29:00-PDT
1. Probably the IBM design will be suitable for QLAMBDA, because
they intend to use the switch to do parallel enqueueing and dequeueing
of processes. In comparison, a 512-processor grid or torus would
probably not be suitable}, because of the (apparent) impossibility
of doing distributed process assignment.
2. The timetable is 3 years out for delivery of hardware, with
berhaps an 8-processor prototype earlier.
Thus, this center would not interfere with a HEP delivered next year, say.
-------
∂24-Aug-84 1433 ULLMAN@SU-SCORE.ARPA Re: ultracomputer offer
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 24 Aug 84 14:32:50 PDT
Date: Fri 24 Aug 84 14:30:56-PDT
From: Jeffrey D. Ullman <ULLMAN@SU-SCORE.ARPA>
Subject: Re: ultracomputer offer
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 24 Aug 84 13:02:00-PDT
I suspect that IBM would be very happy to provide several 8-processor
jobbies if we made a concrete proposal for them.
Let's put some thoughts together; Joe and John H. are also willing
to contribute.
As for partitioning the 512-processor jobbie,machine, I don't know
that this is what they have in mind.
However, I get the feeling that they
view it as a big machine in the tradition of a 3081, say, but
no bigger. It is designed to have all the processors working
in a single physical address space, and so would be amenable to
time-sharing in the usual way, i.e., we'd share time-slices rather
than processor-slices.
By the way, my guess is that you'll
find it a bear to program correectly in QLAMBDA, but if done,
you will have no trouble using the 512 processors in big programs.
-------
∂25-Aug-84 0108 ME DM2500 phone cord
Do you know who last had the DM2500 that is in room 358? It is missing
the cord that connects it to the phone.
∂25-Aug-84 1023 talmy%ucbkim@Berkeley your 2nd talk
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 25 Aug 84 10:23:10 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA02977; Sat, 25 Aug 84 10:21:52 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA02355; Sat, 25 Aug 84 10:23:00 pdt
Date: Sat, 25 Aug 84 10:23:00 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8408251723.AA02355@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: your 2nd talk
Cc: talmy%ucbkim@Berkeley
Sept. 25 is just fine. Thanks. Could you send me a title and an abstract
for our announcements, whenever it's convenient (though preferably before
the talk)?
∂25-Aug-84 1144 CLT
It would be better to say |(A . B)| instead of {\sx (A . B)}
etc. since this will work in both latex and clttex
and \sx won't
∂26-Aug-84 1114 FEIGENBAUM@SUMEX-AIM.ARPA [Jeff Ullman <ullman@diablo>:]
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 26 Aug 84 11:14:21 PDT
Date: Sun 26 Aug 84 11:14:28-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: [Jeff Ullman <ullman@diablo>:]
To: jmc@SU-AI.ARPA
Return-Path: <ullman@diablo>
Received: from diablo by SUMEX-AIM.ARPA with TCP; Fri 17 Aug 84 14:11:54-PDT
Date: Fri, 17 Aug 84 14:11:55 pdt
From: Jeff Ullman <ullman@diablo>
To: feigenbaum@sumex
I'm thinking seriously of trying to get together a proposal for
an NSF "regional" center for supercomputation, based on an IBM
PR-3 512-processor supercomputer. In addition to IBM
and Stanford, we might include Berkeley, perhaps SRI, as contributors.
Apparently such a proposal should be developed over the next
few months to have the best chances.
Any interest?
I imagine that the "partners" would each have to write some
description of their potential use of the machine.
There would be little or no direct research funding through the
proposal.
-------
∂26-Aug-84 1506 JL05@CMU-CS-A.ARPA Kuo return soon.
Received: from CMU-CS-A.ARPA by SU-AI.ARPA with TCP; 26 Aug 84 15:06:37 PDT
Date: 26 Aug 84 1805 EDT (Sunday)
From: Jian-Xiang.Lin@CMU-CS-A.ARPA
To: JMC@SU-AI.ARPA
Subject: Kuo return soon.
Message-Id: <26Aug84.180539.JL05@CMU-CS-A.ARPA>
Dear Prof. McCarthy:
I visited my birthplace in Louisiana after the AAAI-84 Conference. It was
a very nice and exciting trip, and now I am visiting the Cornell University
and Carnegie-Mellon University by invitation of my friends and will come
back onWednesday.
Best regards.
Sincerely,
Victor Kuo
∂27-Aug-84 1012 TWALKER@SRI-AI.ARPA "Luncheon Reminder"
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 27 Aug 84 10:11:24 PDT
Date: Mon 27 Aug 84 10:08:51-PDT
From: TWALKER@SRI-AI.ARPA
Subject: "Luncheon Reminder"
To: aic-staff@SRI-AI.ARPA,
commonsense.people: ;
cc: twalker@SRI-AI.ARPA
Today's the day.....Yuen Yung Restaurant
639 Santa Cruz Avenue
12:00 noon
BE THERE!
-------
∂27-Aug-84 1027 GOTELLI@SU-SCORE.ARPA Re: my account
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 27 Aug 84 10:27:14 PDT
Date: Mon 27 Aug 84 10:25:48-PDT
From: Lynn Gotelli <GOTELLI@SU-SCORE.ARPA>
Subject: Re: my account
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 27 Aug 84 10:02:00-PDT
Good! Then we both did it!
-------
∂27-Aug-84 1330 CLT tex equations
% for simple aligned equations - use DEKs \eqalign
%$$ \eqalign{%
% ...
% lhs & = rhs \cr
% ...
% }$$
∂27-Aug-84 1359 RA selfridge
selfridge is out. I left your number for him to call you back.
∂27-Aug-84 1418 RA Alex Jacobson
Jacobson is in a meeting. He will call you later this afternoon.
∂27-Aug-84 1504 EDMISTEN@SUMEX-AIM.ARPA ANNOUNCEMENT FOR FRIDAY, AUGUST 31, 1984
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Aug 84 15:01:36 PDT
Date: Mon 27 Aug 84 14:56:50-PDT
From: Paula Edmisten <Edmisten@SUMEX-AIM.ARPA>
Subject: ANNOUNCEMENT FOR FRIDAY, AUGUST 31, 1984
To: SIGLUNCH@SUMEX-AIM.ARPA
cc: Edmisten@SUMEX-AIM.ARPA
SIGLUNCH
DATE: Friday, August 31, 1984
LOCATION: Chemistry Gazebo, between Physical and Organic Chemistry
TIME: 12:05
SPEAKER: Dr. Randy Miller
University of Pittsburgh, School of Medicine
ABSTRACT:
Dr. Randy Miller of the University of Pittsburgh School
of Medicine will discuss the work he and Jack Myers have
done on CADUCEUS over the past three years. Using
INTERNIST-1's knowledge base as a point of departure, they
have developed a more comprehensive representation scheme
for general medical knowledge. The main goal has been to
produce an experimental testbed for the incremental develop-
ment of new diagnostic strategies. Beginning with a discus-
sion of INTERIST-1's strengths and weaknesses, Dr. Miller
will describe the design constraints and preliminary results
of this "bottoms-up" approach to the reworking of
INTERNIST-1.
Paula
-------
∂27-Aug-84 1639 LERMAN@SRI-KL.ARPA Re: By-laws
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 27 Aug 84 16:39:21 PDT
Date: Mon 27 Aug 84 16:37:56-PDT
From: Lee Erman <LErman@SRI-KL.ARPA>
Subject: Re: By-laws
To: Stefik.pa@XEROX.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA, Amarel@RUTGERS.ARPA, Brachman@SRI-KL.ARPA,
Bledsoe@UTEXAS-20.ARPA, Buchanan@SUMEX-AIM.ARPA, KRD@MIT-MC.ARPA,
Bengelmore@SRI-KL.ARPA, Genesereth@SUMEX-AIM.ARPA, Hart@SRI-AI.ARPA,
JMC@SU-AI.ARPA, Minsky@MIT-MC.ARPA, Nilsson@SRI-AI.ARPA,
Reddy@CMU-CS-A.ARPA, Rich@MIT-MC.ARPA, Stan@SRI-AI.ARPA,
Shortliffe@SUMEX-AIM.ARPA, Tenenbaum@SRI-KL.ARPA, Walker@SRI-AI.ARPA,
PHW@MIT-MC.ARPA, Fikes%usc-ecld@USC-ECL.ARPA, aaai-office@SUMEX-AIM.ARPA
In-Reply-To: Message from "Stefik.pa@XEROX.ARPA" of Thu 16 Aug 84 18:32:00-PDT
Mark,
The rules of the AAAI are contained in its By-laws. These were
published in the AI Mag, vol. 2, No. 1, Winter 1980/81, pp. 38-42. I don't
believe they have been amended since then.
Presumably anyone who has any corrections to any of these statements
will speak up.
--Lee
-------
∂27-Aug-84 2033 ME RA and SCY priv
Your new secretary RA now has the SCY (secretary) privilege for disk file
access.
∂28-Aug-84 0946 AAAI-OFFICE@SUMEX-AIM.ARPA Basic Research Committee
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 28 Aug 84 09:46:19 PDT
Date: Tue 28 Aug 84 09:46:26-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Basic Research Committee
To: JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
John,
Can you tell me something about the goals of the Basic Research
committee and who you would like to see on the committee?
I'm helping Woody organize these new committees for next year,
and the first order of business is identifying committee
members and having their first meeting.
In the future, if you need any help with this committee, just
call.
--Claudia
-------
∂28-Aug-84 1240 CLT
i fixed jmctst to cltex is - .do c<cr> and reply jmctst to f=
∂28-Aug-84 1332 RA Allan McKean
Called. Please call back 408 263 7500 ext. 5395
∂28-Aug-84 1646 RA LISP manuals
The books were ordered. The bookstore says that they will be here a
week before classes begin.
∂29-Aug-84 0900 JMC*
Jude Franklin 202 767-2884.
∂29-Aug-84 0925 RA CS206
Roy D. Souza works at HP lab and takes the class by TV. Wants to know
whether he can take the class using Portable Standard LISP to do his
assignments
∂29-Aug-84 0945 JK
∂29-Aug-84 0944 JMC
With whom did you talk at NSF? Do you have a phone number?
-------
Dr.Barns, I think. It used to be
chien at nsf: 202-357-9747 (comp sci at nsf) or 202-357-7345 (own phone at nsf)
∂29-Aug-84 1358 RA Roy D. Souza
I called him and gave him the information.
∂29-Aug-84 1406 REGES@SU-SCORE.ARPA Re: Fascist computer programs
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Aug 84 14:02:18 PDT
Date: Wed 29 Aug 84 14:00:55-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Re: Fascist computer programs
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 29 Aug 84 02:17:00-PDT
Office: Margaret Jacks 210, 497-9798
I'm not sure exactly what your complaint is. I can think of a few
possibilities:
1) PEDIT won't allow you to make your mailing address "JMC@SAIL". It
will make it "JMC@SU-AI". It will, however, recognize the name SAIL
when you are making the change. Perhaps this borders on fascism, but
the real host name is SU-AI, and not all mailing programs will
recognize the nickname.
2) PEDIT won't let you enter more than one EMAIL address. This is
because we want your preferred EMAIL. This could be changed, but
I didn't anticipate a problem. Maybe we could do different EMAIL's,
and let the user say things like "junk mail EMAIL" versus "good mail
EMAIL". This presents problems for us, however. We want to
automate the generation of mailing lists and set up the host
STANFORD allow mail to J.MCCARTHY@STANFORD. The software we write
for such applications won't be smart enough to decide which EMAIL
to use for mail forwarding. That is why I went with the simple
approach of one EMAIL for one person.
3) Perhaps you encountered a bug.
4) Perhaps you found the program too difficult to use.
Which of these is the problem, or is it something else? I find I can say:
change email jmc@sail
in PEDIT to enter this EMAIL.
-------
∂29-Aug-84 1421 ARK Re: Fascist computer programs
To: JMC@SU-AI.ARPA, Other-SU-BBoards@SU-AI.ARPA,
Damon@SU-SCORE.ARPA, Ali@SU-SCORE.ARPA, Stuart@SU-SCORE.ARPA
ARK - The address you list there is currently used for two purposes. It
appears on the screen. And it is used for sending people mail by programs
that look in the field. Hence it must be a valid computer address. You
probably do want JMC-LISTS@SAIL in that field. But you probably also want
a comment field of "Personal messages should be sent to JMC@SAIL." I do
not know how to do this, but perhaps Damon, Ali, or Stuart does, or can
make the feature available.
∂29-Aug-84 1445 RA Lester Ernest
Would like you to call him (56) 986 9400. Sorry, I forgot
to ask him waht it was about.
Norm Hardy is a possible candidate. 408 446-6208
∂29-Aug-84 1447 RA Parking
Shall I mail the form the Police Dept. or do you want it back?
∂29-Aug-84 1533 Mailer failed mail returned
The following message was undeliverable to recipient(s):
stuart@SU-SCORE.ARPA
Here is how the remote host replied to this mail address:
stuart@SU-SCORE.ARPA
550 No such local mailbox as "stuart", recipient rejected
------- Begin undelivered message: -------
∂29-Aug-84 1533 JMC
To: stuart@SU-SCORE.ARPA
CC: ARK@SU-AI.ARPA
ARK's explanation and proposal are both correct.
------- End undelivered message -------
∂29-Aug-84 1622 REGES@SU-SCORE.ARPA Mailing
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Aug 84 16:22:42 PDT
Date: Wed 29 Aug 84 16:13:56-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Mailing
To: jmc@SU-AI.ARPA
cc: ark@SU-AI.ARPA
Office: Margaret Jacks 210, 497-9798
The old people data base had a COMMENT tag where special notes like this could
be included. We put a COMMENT field in our 1022 data base and allowed PEDIT
to update it. PEDIT has been running now for almost a year, and nobody ever
put a comment in. So we deleted the field. We can certainly revive it, though.
This would allow you to put a notation about your EMAIL field.
-------
∂29-Aug-84 2000 JMC*
fei about lm2
∂29-Aug-84 2211 JK
I think I have your problem solved in at least the case I am
interested in. All I would need to add to EKL is a selection
operator. Even this can be done without enshrining axiom of choice if
some stuff is added to the rewriter.
A question, however: When you talk about "functions arising from compositions"
do you mean instances of the fix point schema
F(f)=f
where F is the continuous functional λh.g⊗h arising from the continuous
function g.
I am not sure I understand the question, but I don't consider
f defined as the fixed point of F as "arising from composition".
∂30-Aug-84 0705 JK
∂29-Aug-84 2216 JMC
I am not sure I understand the question, but I don't consider
f defined as the fixed point of F as "arising from composition".
-------------
The question is this: You have a schema in mind that so far as I understand
comes from the fixpoint schema F(f)=f. The question is, what can F be.
Obviously, F has to be continuous. One way to construct continuous
functionals is, as you pointed out, through compositions. That is,
F has to have the form
λf.h⊗f⊗g1⊗f⊗....⊗f⊗gn
where h,g1,....,gn are continuous. Is this all you want?
∂30-Aug-84 0934 RA
Will you be in this morning?
∂30-Aug-84 0938 avg@Navajo Re: Fascist computer programs
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 30 Aug 84 09:38:25 PDT
Date: Thu, 30 Aug 84 09:36 PDT
From: Allen Van Gelder <avg@Navajo>
Subject: Re: Fascist computer programs
To: JMC@SU-AI.ARPA, su-bboards@Navajo
I think it is generally accepted that sceening data upon input is the
best way to keep databases useful. Allowing errors on the theory
that they can be fixed later has caused systems to get completely out
of control.
To call this effort by a student "fascist" is probably
not helpful to his or her education. Through practice, people who are
going to implement database systems need to learn about the problem
areas. The trade-off between allowing errors in and keeping valid
data out is definitely a problem area. Better that students be
encouraged to try things here and learn than that they go off
half-cocked and start making these judgements on credit bureau
databases, etc.
There IS another reason why it cant accept an arbitrary field, although
you may not think it's a good one, and it may not be the reason it
rejected your entry. That reason is that the underlying software,
the 1022 DB system, requires a maximum length to be specified on all
fields. The "designer" of PEDIT may have specified too short a length
to allow what you want. Furthermore, 1022 requires fields with
embedded spaces to be enclosed in quotes of some kind, for some
transactions. Maybe the implementation of the PEDIT - 1022 interface
is a bit sloppy on this.
∂30-Aug-84 1148 RA
Your hotel reservation was cancelled
∂30-Aug-84 1204 RA D. Souza about your CS206
1. Would like to know the name of the TA for CS206.
2. Would like to know where he can find information about getting
Common LISP on Dec-20 from Stanford to HP Dec-20
The TA will be Gianluigi Bellin 497-1517 and GLB@su-ai.
Gianluigi doesn't know
about how to transfew Common Lisp yet, but he'll have to.
Have you met him?
∂30-Aug-84 1330 RA
So far I haven't met Gianluigi
∂30-Aug-84 1515 RA
I need the dates for Bill Gosper's stay here.
∂30-Aug-84 1554 RA
I booked you on PSA 164 at 8:30 from SJ 8/31/84. Arr. 9:30.
For the trip back, there is a Western flight at 2:45 and a PSA
flight at 2:30. Which one do you want. It's too late for them
to deliver the tickets. You'll have to pick them up at the airport.
∂30-Aug-84 1639 EMMA@SU-CSLI.ARPA New forms
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 30 Aug 84 16:39:02 PDT
Date: Thu 30 Aug 84 16:35:41-PDT
From: Emma Pease <EMMA@SU-CSLI.ARPA>
Subject: New forms
To: principals@SU-CSLI.ARPA, bratman@SU-CSLI.ARPA, etchemendy@SU-CSLI.ARPA,
mesequer@SRI-AI.ARPA
The new forms have arrived. Hardcopies can be gotten from Ingrid, Bach-Hong
and, in a few days, Jackie Guibert and Elsie Chappel. Hardcopies can also
be gotten by running off the DVI file of the form.
If you want to examine the online version of the forms, look at the
.tex version. The .dvi version can be run off on the Canon printer
for a hard copy of the form.
The following is a short description of each form.
PS:<CSLI>
FORM-HELP-FORMS.TXT ;This file
FORM-OPERANT-FUNDS.DVI.1 ;Must be used to request funds
;for visitors, workshops/
;conferences, travel...
FORM-VISITORS-REPORT.DVI.1 ;Must be filled out by a
;visitor when he/she leaves
FORM-WORKSHOP-REPORT.DVI.1 ;Must be filled out when a
;workshop or conference is completed
FORM-WORKSHOP-PLAN.DVI.1 ;Must be filled out when a
;workshop or conference is planned
Please see Ingrid Diewicks, if you have any questions or comments.
-Emma (from the Ventura Garret)
-------
∂30-Aug-84 1900 JMC*
shop
∂30-Aug-84 2321 talmy%ucbkim@Berkeley directions
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 30 Aug 84 23:21:04 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA00500; Thu, 30 Aug 84 06:52:21 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA19286; Thu, 30 Aug 84 01:40:12 pdt
Date: Thu, 30 Aug 84 01:40:12 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8408300840.AA19286@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: directions
Cc: talmy%ucbkim@Berkeley
John-- Here's how to get to the right place on campus to park. These
directions hold both for Sept 4 and Sept 25:
Assuming you're arriving via Highway 17:
Take the University Ave. turnoff.
Go east on University Ave. till you hit the west edge of the campus,
where you turn left onto Oxford.
Go north till Hearst, where you turn right.
Go east till Gayley, where you turn right.
Go a bit along Gayley and take the first turnoff to the right into the campus.
Give the guard your name (he'll have it on his list), enter and park.
Ask someone directions to Bechtel--it's close by.
If you arrive close to 11 a.m., go straight to Bechtel 240, where the
talk will take place.
If you arrive early, you're welcome to come by Bldg T-4 (in front of Bechtel),
where Cognitive Science folks have their offices (mine is 204).
See ya soon. --Len
∂31-Aug-84 0813 BSCOTT@SU-SCORE.ARPA Re: damage by carpet cleaners
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 31 Aug 84 08:12:59 PDT
Date: Fri 31 Aug 84 08:11:28-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: damage by carpet cleaners
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 30 Aug 84 22:00:00-PDT
Yes, it's O'Connor cleaners, contracted by Stanford. I know that they will
stack chairs on desks--I'll talk to them about this today.
Betty
-------
∂31-Aug-84 1307 RA
Beverly Howell from Raj Ready's office at CMU called about your
ticket arrangements for your Sept. 22 Paris trip. You can make
your own bus. class ticketing and they'll reimburse you, or they
can make the arrangements and mail tickets to you.
∂01-Sep-84 1841 ME Prancing Pony Bill
Prancing Pony bill of JMC John McCarthy 1 September 1984
Previous Balance 3.06
Monthly Interest at 1.5% 0.05
Current Charges 29.90 (vending machine)
-------
TOTAL AMOUNT DUE 33.01
Please deliver payments to Rutie Adler, room 358, Jacks Hall.
Make checks payable to: STANFORD UNIVERSITY.
To ensure proper crediting, please include your Pony account name on your check.
Bills are payable upon presentation. Interest of 1.5% per month will be
charged on balances remaining unpaid 25 days after bill date above.
You haven't paid your Pony bill since 2/84.
Accounts with balances remaining unpaid for more than 55 days are
considered delinquent and are subject to reduction of credit limit.
Please pay your bill and keep your account current.
∂02-Sep-84 1650 MXB upcoming panel discussion
Terry can do it on Monday Oct 1 or Wed Oct 3. Those doλ← dates are
bothOK with Sevaro Ornstein also. The previous week is better for him,
and otherwise it has to be late in October, after ACM. I hope Oct 1 or 3
is OK with you.
I gave the title and content some more thought. Perhaps the title could be
"Survival and Prosperity--how should computers help us?" What do you
think of that? Note "should" not "will" or "could". I have mixed feelings
about "survival" because we want not only to survive but to live in a
world where people are happy. But I don't know how to say that succinctly,
so this was the best I could do.
The format is the next matter to be decided. Unless someone better becomes
available, I will moderate the discussion, as the host. That means I will
not directly participate. I would like to see a lot of give and take,
as aλ opposed to long presentations.
You can send me mail on this computer, I'm mxb.
∂02-Sep-84 1701 MXB identification
Correct. I know not how to use the "write" command, or whaterver it's
called, on this machine, and also not how to bckspace. Sorry about that.
∂02-Sep-84 1709 MXB more on the panel
Then we'll let the schedules of theothers determine which of the two
it will be. I have in mind 5:30 p.m., because that's the time my AI class usually meets,
and because it permits people who get off work at 5 to come.
I was thinking of about two hours duration.
Whether that breadth of title means "mot much" about the Strategic
Computing plan I am less certain. Because of the plan's concreteness
and potential impact on the AI research community, I would like to see
it discussed, although as I said before I would not like it to bee the
sole or even necessarily the main topic. I would like to see the question
addressed whether this is the sort of thing that will help us survive
and prosper, or whether it will have the opposite effect. That question
seems crucial to me, and it's ovbious that some rather intelligient
people can't agree about it, since I think it's a fair assumption that
everyone wants to see us survive and prosper. (Though there is some
question about the breadth of interpretatin of "us".)
jmc-
OK, but the DARPA plan is actually only a small fraction of the money
going into defense and the money going into computing. It is even
much less than half of the money going into defense computing. The
amount of the strategic computing money going into AI research is
so far trivial, maybe nonexistent. Therefore, the effect of the
plan on either survival or prosperity is likely to be minor. My
opinion is that it will be a small benefit, probably worth its
small cost (compared to other defense efforts).
∂02-Sep-84 1715 MXB Severo
I have never had occasion until today to write his name, and hesitated
before guessing a spelling. Of course I will check it. I will also
leasrn how to use the editor on this machine asap so that in the future
you don't have to read so many typing errors.
∂02-Sep-84 1722 MXB more
The points you mention are good ones, and your opinion is
interesting to me, especially if the reasons for it are brought
out. These are more good reasons for not making the plan a major
focius of discussion. Nevertheless, even if the amounts involved
are small, I think the plan is psychologically touching some key
issues. Compare its aims, for instance, to the stated aims of
the Japanese project, all or of which are high-sounding
humanitarian goals. The questiion I raised, whether this is
the sort of thing we ought to do, is independent of the amount
of the funding, or even of its effect, which might very well be
good overall, especially for the research community, without
that implying that it is the best thing to do. Some other course
might be better still. To make the point in an exxagerated way,
if a certain course of action has very good results for a time but
leads in the end to a destructive war, some other course would have
been better.
I've enjoyed this conversation and will happily continue it, but
I have to log off now and take care of my daughter.
∂03-Sep-84 1602 chertok%ucbkim@Berkeley Berkeley Cognitive Science Seminar--Sept. 4
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 3 Sep 84 16:02:41 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA10970; Mon, 3 Sep 84 16:02:36 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA02064; Mon, 3 Sep 84 16:02:34 pdt
Date: Mon, 3 Sep 84 16:02:34 pdt
From: chertok%ucbkim@Berkeley (Paula Chertok)
Message-Id: <8409032302.AA02064@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: Berkeley Cognitive Science Seminar--Sept. 4
BERKELEY COGNITIVE SCIENCE PROGRAM
Fall 1984
Cognitive Science Seminar -- IDS 237A
TIME: Tuesday, September 4, 11-12:30pm
PLACE: 240 Bechtel Engineering Center
DISCUSSION: 12:30-2pm, 200 Building T-4
SPEAKERS: John R. Searle, Philosophy Dept, UC Berkeley
John McCarthy, Computer Science Dept, Stanford Univ.
TITLE: First Person and Third Person Points of View in
Cognitive Science, Philosophy of Mind, and Epistemology
-----------------------------------------------------------------------
UPCOMING TALKS:
Sept. 11: Lotfi Zadeh on ``Typicality, Prototypicality,
Usuality, Dispositionality, and Common Sense''
-----------------------------------------------------------------------
Please note: Anyone receiving these Cognitive Science
announcements that has changed address, or anyone wishing to
be placed on the mailing list (hardcopy or electronic),
please contact the Program at:
(415) 642-8461 or chertok@ucbkim.arpa
---------------
Sorry this comes so late, but the first run didn't work.
Paula Chertok
∂03-Sep-84 2238 RTC Common Lisp OS
I have thought about it some more, and I am still
interested. Have you heard any more from IBM?
Ross
∂04-Sep-84 0846 RA
I will be in an orientation meeting this morning. Be back this afternoon.
∂04-Sep-84 0908 RINDFLEISCH@SUMEX-AIM.ARPA Re: TI Hardware
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Sep 84 09:08:42 PDT
Date: Tue 4 Sep 84 09:08:27-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: TI Hardware
To: HPP-Exec@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, RPG@SU-AI.ARPA,
Reges@SU-SCORE.ARPA, Hennessy@SU-SCORE.ARPA, BMR@SU-AI.ARPA
cc: Golub@SU-SCORE.ARPA, Rindfleisch@SUMEX-AIM.ARPA
In-Reply-To: Message from "T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>" of Thu 23 Aug 84 18:05:51-PDT
This is to confirm that a contingent from Texas Instruments will be here this
Thursday (Sept 6) from 9:00 - 12:00 to talk about their Lisp machine products
and plans. We will meet in the HPP conference room at 701 Welch Road, Building
C. TI will give a presentation followed by questions and discussion of where
we go next. Tentatively, the TI group will include:
Joe Watson Head of the Lisp Machine Division
John Alden Mgr, Educational Marketing Rindfleisch 7-9373
Truman Blocker Mgr, Software Development
Gene Mathews Mgr, VLSI Lisp Machine Development
Ed Harrel Software Marketing
Tom R.
-------
∂04-Sep-84 1200 RA
George Minot at 614 457 8600 called. Wants to talk to you about
an Applied Information Tech. Research they are establishing.
∂04-Sep-84 1238 RA
There was a message in your box to let you know that Mr. Jacobson
called and said that arrangements are fine.
∂04-Sep-84 1259 LEIB@SU-SCORE.ARPA Another one.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Sep 84 12:58:54 PDT
Date: Tue 4 Sep 84 12:57:38-PDT
From: Rita Leibovitz <LEIB@SU-SCORE.ARPA>
Subject: Another one.
To: jmc@SU-AI.ARPA
Stanford-Phone: (415) 497-4223
Well, John, do have a happy birthday and many more!
-------
∂04-Sep-84 1446 RA
Are you expecting a package from Digital?
∂04-Sep-84 1600 RA
The manuals are here! The manuals are here!
∂04-Sep-84 1619 MRC@SU-SCORE.ARPA Happy Birthday
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 4 Sep 84 16:19:22 PDT
Date: Tue 4 Sep 84 16:17:46-PDT
From: Mark Crispin <MRC@SU-SCORE.ARPA>
Subject: Happy Birthday
To: JMC@SU-AI.ARPA
Postal-Address: 725 Mariposa Ave. #103; Mountain View, CA 94041
Phone: (415) 497-1407 (Stanford); (415) 968-1052 (residence)
-- Mark --
-------
∂04-Sep-84 1725 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley better mail route
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 4 Sep 84 17:25:32 PDT
Received: by UCB-VAX.ARPA (4.24/4.33)
id AA04294; Tue, 4 Sep 84 17:25:29 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA03049; Tue, 4 Sep 84 16:35:16 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA01559; Tue, 4 Sep 84 16:16:02 pdt
Date: Tue, 4 Sep 84 16:16:02 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8409042316.AA01559@ucscg.UCSC>
To: ucbvax!su-ai.jmc@Berkeley
Subject: better mail route
I seem to have found a form of address that the network mail
program accepts. (It rejects some the manual says should be OK.)
This is an easier way for me to get electronic mail to you than
to dial up SAIL long-distance as I did the other day.
Before settling on Oct. 1 or Oct. 3 we need to connect with
Stefik (sp?). Terry said he would do that, since he knows him,
but he is out of town this week, so there will be a delay in
deciding between the two dates.
How does this sound for a format: ten-minute individual presentations
by each of the four participants, with the time limit impersonally
enforced by a timer, followed by a period of discussion between the
panelists, followed by questions from the floor. Total time should be
one and a half hours, with the possibility of running over if the
audience is not itching to leave.
If you sent me any mail on SAIL that I should call up to get since
our last conversation, tell me that in your reply to this address.
∂04-Sep-84 1943 EDMISTEN@SUMEX-AIM.ARPA NONE
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 4 Sep 84 19:42:56 PDT
Date: Tue 4 Sep 84 17:09:04-PDT
From: Paula Edmisten <Edmisten@SUMEX-AIM.ARPA>
Subject: NONE
To: SIGLUNCH@SUMEX-AIM.ARPA
cc: Edmisten@SUMEX-AIM.ARPA
There will be no SIGLUNCH this Friday!!!!!!
Thanx,
Paula
-------
∂05-Sep-84 0841 GARDNER@SU-SCORE.ARPA CBCL
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Sep 84 08:41:08 PDT
Date: Wed 5 Sep 84 08:39:25-PDT
From: Anne Gardner <GARDNER@SU-SCORE.ARPA>
Subject: CBCL
To: jmc@SU-AI.ARPA
cc: gardner@SU-SCORE.ARPA
After my oral last year, you hinted that there might be a possibility
of working with you on the common business communication language.
I'm actively job hunting now, and if you're interested in pursuing the
subject I would certainly like to.
Anne
-------
∂05-Sep-84 0900 RA William Gosper card
Did I understand you correctly? He is from Symbolics Corp. and his visit
is indefinite?
∂05-Sep-84 0918 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA F4 meeting time
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 5 Sep 84 09:18:28 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 5 Sep 84 09:16:37-PDT
Date: Wed 5 Sep 84 09:16:19-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: F4 meeting time
To: f4@SU-CSLI.ARPA, pkanerva@SU-CSLI.ARPA
I didn't receive any objections to Tuesdays 3:15-5:00 as a regular
meeting time, so lets plan on that being it. Remember that our first
meeting will be on October 2. I'll send out a notice of where the
meeting will be.
--Bob
-------
∂05-Sep-84 1057 RA
I mailed Sato the message. I did ask him to respond but have not
heard from him.
∂05-Sep-84 1117 RA
Sato has just acknowledged my message about the meeting
∂05-Sep-84 1348 RA iii invoice
Do I send the receipts with the invoice?
∂05-Sep-84 1356 RA
Do you have a file where you file the invoices you send?
∂05-Sep-84 1406 RA
I left a telex for you on your desk.
∂05-Sep-84 1656 REGES@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 5 Sep 84 16:56:21 PDT
Date: Wed 5 Sep 84 16:54:56-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 5 Sep 84 11:45:00-PDT
Office: Margaret Jacks 210, 497-9798
I probably won't be able to restore the COMMENT field until the programmer who
works on PEDIT returns from his vacation (about 3 weeks). I thought that you
wouldn't want to be cut off from the world in the interim. I was the one who
put JMC-LISTS as your email, but I will remove it.
Do you still want to receive mail sent to the faculty distribution list? If so
I'll have to modify the list by hand in the interim to include you. We now
generate this mailing list directly from the database.
-------
∂06-Sep-84 1115 BSCOTT@SU-SCORE.ARPA Bruce Barnes
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 11:15:06 PDT
Date: Thu 6 Sep 84 11:13:21-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Bruce Barnes
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
Bruce Barnes' phone number is (202) 357-7345.
-------
∂06-Sep-84 1222 chertok%ucbkim@Berkeley UCB Cognitive Science Seminar--Sept. 11
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 12:22:40 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.33)
id AA06631; Thu, 6 Sep 84 12:16:36 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA03108; Thu, 6 Sep 84 12:15:46 pdt
Date: Thu, 6 Sep 84 12:15:46 pdt
From: chertok%ucbkim@Berkeley (Paula Chertok)
Message-Id: <8409061915.AA03108@ucbkim.ARPA>
To: cogsci-friends%ucbkim@Berkeley
Subject: UCB Cognitive Science Seminar--Sept. 11
BERKELEY COGNITIVE SCIENCE PROGRAM
←λF←λa←λl←λl ←λ1←λ9←λ8←λ4
Cognitive Science Seminar -- IDS 237A
TIME: Tuesday, September 11, 11 - 12:30pm
PLACE: 240 Bechtel Engineering Center
DISCUSSION: 12:30 - 2 in 200 Building T-4
SPEAKER: L.A. Zadeh
Computer Science Division, UC Berkeley
TITLE: Typicality, Prototypicality, Usuality,
Dispositionality, and Common Sense
ABSTRACT:
The grouping of the concepts listed in the title of this
talk is intended to suggest that there is a close connection
between them. I will describe a general approach centering
on the concept of dispositionality which makes it possible
to formulate fairly precise definitions of typicality and
prototypicality, and relate these concepts to commonsense
reasoning. These definitions are not in the classical
spirit and are based on the premise that typicality and pro-
totypicality are graded concepts, in the sense that every
object is typical or prototypical to a degree. In addition,
I will outline what might be called a calculus of usual
values.
∂06-Sep-84 1331 RA
Dr. Kahn called. Would like you to call back: 202 694 5922. His
secretary did not know what it is about.
∂06-Sep-84 1449 RA
This is to remind you to call Fenaughty.
∂06-Sep-84 1541 RA
Fenaughty called again. Please call him: 213 390 8611
∂06-Sep-84 1545 RA
There is a letter from Centre Mondial on top of your pile. I thought
it might be important.
∂06-Sep-84 1642 A.SANDY@SU-GSB-HOW.ARPA Re: TIMM
Received: from SU-GSB-HOW.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 16:42:43 PDT
Date: Thu 6 Sep 84 16:39:45-PDT
From: Sandy Lerner <A.SANDY@SU-GSB-HOW.ARPA>
Subject: Re: TIMM
To: JMC@SU-AI.ARPA
cc: sandy@SU-GSB-WHY.ARPA, A.SANDY@SU-GSB-HOW.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 6 Sep 84 16:16:00-PDT
Thanks for the info. I have trouble getting people here to understand
what an expert system is, much less why they should want one. I will
continue.
-------
∂06-Sep-84 1643 A.SANDY@SU-GSB-HOW.ARPA Re: TIMM
Received: from SU-GSB-HOW.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 16:43:46 PDT
Date: Thu 6 Sep 84 16:40:26-PDT
From: Sandy Lerner <A.SANDY@SU-GSB-HOW.ARPA>
Subject: Re: TIMM
To: JMC@SU-AI.ARPA
cc: sandy@SU-GSB-WHY.ARPA, A.SANDY@SU-GSB-HOW.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 6 Sep 84 16:34:00-PDT
Thanks again for the input. I will get hold of the other companies.It didn't
look too terribly winning.
-------
∂06-Sep-84 1658 ullman@diablo HEP
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 16:58:06 PDT
Date: Thu, 6 Sep 84 16:58:39 pdt
From: Jeff Ullman <ullman@diablo>
Subject: HEP
To: jmc@sail
The last breakdown that I have shows $450K in the third year
for a large mainframe and says it is for "mostly AI", i.e.,
you and the people you were to represent.
∂06-Sep-84 1801 GOLUB@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 6 Sep 84 18:01:23 PDT
Date: Thu 6 Sep 84 17:48:41-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 6 Sep 84 17:41:00-PDT
Sorry
-------
∂07-Sep-84 0129 REGES@SU-SCORE.ARPA accounts/mail for new CS students
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Sep 84 01:29:02 PDT
Date: Fri 7 Sep 84 01:19:08-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: accounts/mail for new CS students
To: students@SU-SCORE.ARPA, faculty@SU-SCORE.ARPA, staff@SU-SCORE.ARPA
cc: su-bboards@SU-SCORE.ARPA
Office: Margaret Jacks 210, 497-9798
I have just created SCORE computer accounts for all the new students and set
all the appropriate values in the people data base. This means LOOKUP and
FINGER will now show information about them. We will open up SAIL accounts for
all the new PhD students, but this will happen later.
I have also just generated the following mailing lists from the people
database:
file keyword description
------------------------------------------------------------
faculty.dis faculty faculty members
masters.dis ms all Masters students
new-ms.dis new-ms new students in the MS program
new-msai.dis new-msai new students in the MS-AI program
new-phd.dis new-phd new students in the PhD program
phd.dis phd all PhD students
staff.dis staff all CS staff members
All of these mailings lists are on the directory <CS.PUBLIC> on SCORE. The
keywords listed above can be used instead of trying to include the mail file
directly. The mail files do provide a useful list of names, however. If any
of you want to give some information to the new students, I strongly suggest
you use these mailing lists.
These mailing lists were previously hand-maintained, but I hope to keep them
automated from now on. If anyone notices an error, please report it to me. If
your EMAIL address is not correct, please use PEDIT to change your EMAIL field
and I will then regenerate the lists from the database. Within a couple of
months PEDIT will allow you to not only indicate your EMAIL address but also
what mailing lists you would like to be added to or deleted from.
-------
∂07-Sep-84 0539 KAHN@USC-ISI.ARPA Re: HEP
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 7 Sep 84 05:39:19 PDT
Date: 7 Sep 1984 08:39-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: HEP
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: kahn@USC-ISI.ARPA, RPG@SU-AI.ARPA
Cc: ullman@SU-AIMVAX.ARPA
Message-ID: <[USC-ISI.ARPA] 7-Sep-84 08:39:16.KAHN>
In-Reply-To: The message of 06 Sep 84 1720 PDT from John McCarthy <JMC@SU-AI.ARPA>
John,
ok. keep me posted.
Before you put too much energy into this can you
provide me upper and lower bounds on the
cost of the stanford portion so i can see if we
can afford the whole package. the denelcor costs
can probably be spread over several years, but im
not sure how much you think you'll need - ballpark.
bob
∂07-Sep-84 1007 RA Office Automation brochure you were looking for
I think I found what you were looking for. It's on your desk. If
that't not it, let me know.
∂07-Sep-84 1021 RA
Pat Ross from SE2 in Washington called re next meeting of the working
group. tel: 202 223 5381. Please call her.
∂07-Sep-84 1143 RA
Ron Ohlander returned your call 202 694 5051
∂07-Sep-84 1152 GOLUB@SU-SCORE.ARPA Misc.
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Sep 84 11:52:06 PDT
Date: Fri 7 Sep 84 11:49:13-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Misc.
To: faculty@SU-SCORE.ARPA
I shall be away Sept 12 through Sept 22. Jeff Ullman will be acting
chairman in my absence.
Our first general faculty meeting will take place Tuesday, Sept 25
at 2:30. If you have any agenda items, let me know.
I have not made any committee assignments other than Colloquium
Chairperson ( Katevenis). If you have any peferences, let me hear them
but I don't expect to take any action on these until October.
See you in the new term, GENE
-------
∂07-Sep-84 1204 GOLUB@SU-SCORE.ARPA Reception
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Sep 84 12:04:19 PDT
Date: Fri 7 Sep 84 11:58:03-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Reception
To: faculty@SU-SCORE.ARPA
cc: bureaucrats@SU-SCORE.ARPA
The annual reception for NEW STUDENTS will take place on Wednesday,
Sept 26 in the afternoon before sunset. The presentation of the
Forsythe Award for Student Teaching will be made.
I do hope you can come.
GENE
-------
∂07-Sep-84 1451 RA
I put the copied article and a refund slip for your unused plane
tickets on your desk.
∂07-Sep-84 1502 GOLUB@SU-SCORE.ARPA reminder
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 7 Sep 84 14:59:52 PDT
Date: Fri 7 Sep 84 14:49:47-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: reminder
To: jmc@SU-AI.ARPA, dek@SU-AI.ARPA, ullman@SU-SCORE.ARPA
cc: GOLUB@SU-SCORE.ARPA
We'll be having lunch with Bill Spencer of Xerox-Parc on Tuesday,
Sept 11 at 12:15. We'll leave from my office around 12. Hope to see you,
GENE
-------
∂08-Sep-84 2120 JOHN@SU-CSLI.ARPA proposal from moore and perry
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 8 Sep 84 21:19:57 PDT
Date: Sat 8 Sep 84 21:19:55-PDT
From: John Perry <JOHN@SU-CSLI.ARPA>
Subject: proposal from moore and perry
To: f1@SU-CSLI.ARPA, f4@SU-CSLI.ARPA
The f4 group decided to set Tuesdays from 3-5 aside for meetings, but
not to meet every week, although not to preclude meeting successvie
weeks when appropriate.
The f1 group made a simlar decision about Monday 3-5, but this time
won't work out, and no other particularly attractive time has
emerged.
We suggest that it might be convenient to share the Tuesday 3-5 time.
This does NOT mean that we propose to merge groups.
The idea is simply that both group use the Tuesday 3-5 slot, and agree
not to meet the same weeks.
This would be a convenience for the large intersection of the groups,
who can focus their f-activities at a single, easily remembered time,
and doesn't seem like a hardship for others.
Of course, either group could arrange extra meetings at other times,
during periods when one meeting every other week isn't enough.
Please give us reactions to this proposal.
-------
∂09-Sep-84 1407 FEIGENBAUM@SUMEX-AIM.ARPA meeting re Denelcor to support our research
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Sep 84 14:07:15 PDT
Date: Sun 9 Sep 84 14:07:36-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
Subject: meeting re Denelcor to support our research
To: rindfleisch@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA
[Joh and Tom, I was not able to get hold of Tom by phone, hence this net message...]
Tom,
John has had a positive response from Bob Kahn re money for a Denelcor
at Stanford. John wants to holda meeting of the various interested
parties (among which are Jeff Ullman's group and us, probably others too).
I would appreciate it if you would attend representing the HPP/architecture-
research interests. Please call John to discvuss time for meeting.
John's home phone is 857-0672.
Office is 7-4430.
Thanks,
Ed
-------
∂09-Sep-84 2300 FEIGENBAUM@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 9 Sep 84 23:00:27 PDT
Date: Sun 9 Sep 84 23:00:49-PDT
From: Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 9 Sep 84 17:30:00-PDT
John,
John, in places it's too heavy-handedly frank, and in others needs some
tuning to distinguish between between future situations that "might be"
and future situations that "will be". In any event, what I will do is
print it out and see what it looks like in its hard-copy form, and
work on it in that form.
Ed
-------
∂10-Sep-84 0854 RINDFLEISCH@SUMEX-AIM.ARPA Re: meeting re Denelcor to support our research
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 08:54:22 PDT
Date: Mon 10 Sep 84 08:54:41-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: Re: meeting re Denelcor to support our research
To: JMC@SU-AI.ARPA
cc: FEIGENBAUM@SUMEX-AIM.ARPA, Rindfleisch@SUMEX-AIM.ARPA
In-Reply-To: Message from "Edward Feigenbaum <FEIGENBAUM@SUMEX-AIM.ARPA>" of Sun 9 Sep 84 14:07:38-PDT
John, I'll be generally available this week to talk about the Denelcor
proposal. When do you want to meet?
Tom R.
-------
∂10-Sep-84 0905 RA
The following is the list I have of your students, are there any additions or
changes?
Talcott, Carolyn 2FCZ451
Bellin, Granluigi 2FCZ762
Casley, Ross 2FCZ762
Mason, Ian 2FCZ762
Moses, Yoram
Weening, Joe
∂10-Sep-84 0955 EDMISTEN@SUMEX-AIM.ARPA ANNOUNCEMENT
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 09:55:07 PDT
Date: Mon 10 Sep 84 09:53:21-PDT
From: Paula Edmisten <Edmisten@SUMEX-AIM.ARPA>
Subject: ANNOUNCEMENT
To: SIGLUNCH@SUMEX-AIM.ARPA
cc: Edmisten@SUMEX-AIM.ARPA
There will be no SIGLUNCH again this Friday, Sept. 14, 1984.
Thanx,
Paula
-------
∂10-Sep-84 1031 CLT flood
I don't know if you noticed the flood in the bathroom downstairs.
I called the plumber - they are supposed to come this afternoon.
Meanwhile perhaps you should not use it - to avoid making more muddy tracks.
∂10-Sep-84 1040 RA
You have a reservation for today at 12:15 at the Faculty Club. I told
Jeff Ullman about the meeting. Oliger is not here and his secretary is
apparently on vacation.
∂10-Sep-84 1341 @SU-CSLI.ARPA:BMOORE@SRI-AI.ARPA first meeting
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 13:41:44 PDT
Received: from SRI-AI.ARPA by SU-CSLI.ARPA with TCP; Mon 10 Sep 84 13:31:42-PDT
Date: Mon 10 Sep 84 13:30:16-PDT
From: Bob Moore <BMOORE@SRI-AI.ARPA>
Subject: first meeting
To: f4@SU-CSLI.ARPA
Since we have agreed to share the Tuesday 3:15-5:00 time slot with F1,
and they are planning to meet the first week of October, we will meet
the second week.
--Bob
-------
∂10-Sep-84 1451 KAHN@USC-ISI.ARPA Re: hep
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 14:50:52 PDT
Date: 10 Sep 1984 17:50-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: hep
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: kahn@USC-ISI.ARPA, ullman@SU-AIMVAX.ARPA
Cc: RPG@SU-AI.ARPA, feigenbaum@SUMEX-AIM.ARPA
Cc: rindfleisch@SUMEX-AIM.ARPA, oliger@SU-NAVAJO.ARPA
Cc: golub@SU-SCORE.ARPA
Message-ID: <[USC-ISI.ARPA]10-Sep-84 17:50:07.KAHN>
In-Reply-To: The message of 10 Sep 84 1353 PDT from John McCarthy <JMC@SU-AI.ARPA>
JOhn,
thanks for the summary. The machine i discussed with Jim Hill of
Denelcor was a single PEM with 256K (data) x 512K (pgm) memory
with a 32MByte mass storage subsystem. The price he quoted is
lower than he has offerred to anyone else and includes a 25%
discount on the hep two when its available (86 or 87) plus a 50%
reimbursement on our investment in hep one. Maintenance will be
about 100k per year over and above the cost of any people they
provide as part of the joint project to keep up the machine.
They will also take care of provisioning for spares at no cost.
For several reasons, the details on total cost are best kept
private until we have closure all around.
bob
∂10-Sep-84 1459 ARK Ross Casley
To: JMC@SU-AI.ARPA, Winslett@SU-SCORE.ARPA
CC: ARK@SU-AI.ARPA
I need to know confirm that you will house Ross Casley in the Fall.
Could you please confirm, and if you know already, which office
will it be and when can he move in? Thanks.
Arthur
∂10-Sep-84 1602 ullman@diablo meeting
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 16:02:15 PDT
Date: Mon, 10 Sep 84 16:02:13 pdt
From: Jeff Ullman <ullman@diablo>
Subject: meeting
To: cheriton@pescadero, jlh@shasta, jmc@sail
Would you guys like to get together for a HEP meeting?
Wednesday is the only lunch I have free this week (gad I'm a busy
fellow), but almost any other time would be OK.
∂10-Sep-84 1643 RA
The mail brought two things from Inf. International. I put them on your
desk. One of them might be the lost item from last week.
∂10-Sep-84 1716 ASUBRAMANIAN@SUMEX-AIM.ARPA Programming project ??
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 17:16:28 PDT
Date: Mon 10 Sep 84 17:16:37-PDT
From: Ashok Subramanian <ASUBRAMANIAN@SUMEX-AIM.ARPA>
Subject: Programming project ??
To: jmc@SU-AI.ARPA
I think the time has come for me to get cracking on a programming project,
so I'd appreciate pointers. I'm looking for something "interesting", whatever
that might mean, "useful" to a non-zero set of people, reasonably well-defined
(not a research project) and doable, and which does not involve looking into
the details of other people's code. I'm willing to compromise on someof those,
but I'd prefer if I do not have to.
Thanks
ashok
-------
∂10-Sep-84 1718 ASUBRAMANIAN@SUMEX-AIM.ARPA Replies to the previous message ...
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 17:18:05 PDT
Date: Mon 10 Sep 84 17:18:20-PDT
From: Ashok Subramanian <ASUBRAMANIAN@SUMEX-AIM.ARPA>
Subject: Replies to the previous message ...
To: jmc@SU-AI.ARPA
cc: ashok@SU-SCORE.ARPA
Please cc it to ashok@score, for that's where I usually read my mail.
Thanks
ashok
-------
∂10-Sep-84 1946 DEK Steen's editorial
Basically I'm in agreement but have two reservations.
(1) Discrete math isn't entirely deserving of the label "rather easy",
although the kind of things typically taught nowadays under that
banner are indeed easy to pick up... I do believe that the
teaching of calculus should be updated, but I don't like the
way people are trying to update it. I plan to think about this
for twenty years and write a new calculus book myself! Thus, I don't
wish to imply that I'm really happy with calculus and other
math courses remaining just as they were.
(2) The biggest defect our students seem to have these days is
in constructing rigorous proofs. It's not the gaps in algebraic
techniques, it's the lack of understanding of what makes an
argument sound. How do you go about proving that statement
implies another, and so forth. Having seen the course materials
my kids had at Gunn High (one of the best in the country), I can
well understand why we are seeing this defect now; students are
rarely asked to make proofs, they are asked to do multiple
choice questions. For this, the students learn how to refine
their skills.... But during July I had to read three theses
full of non sequiturs.
∂10-Sep-84 2054 jlh@su-shasta.arpa HEP lunch
Received: from SU-SHASTA.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 20:54:33 PDT
Date: Monday, 10 Sep 1984 20:52-PDT
To: jmc at Sail <jmc@Sail>
Subject: HEP lunch
From: John Hennessy <jlh@Shasta>
Sorry I missed it, John, we had a small medical emergency at home.
I am getting together with Jeff and David and I'll get an update. John
∂10-Sep-84 2138 cheriton@Pescadero Re: meeting
Received: from SU-PESCADERO.ARPA by SU-AI.ARPA with TCP; 10 Sep 84 21:38:42 PDT
Date: Mon, 10 Sep 84 21:37:12 pdt
From: David Cheriton <cheriton@Pescadero>
Subject: Re: meeting
To: jlh@Shasta, jmc@Sail, ullman@diablo
Does that mean we can or cant share your free lunch?
I am happy with Wed. lunch. Also, Wed. Thurs. or Friday
afternoon are all fine as well. I would prefer to avoid
mornings (when I try to get something useful done).
∂11-Sep-84 0006 jlh@su-shasta.arpa Re: meeting
Received: from SU-SHASTA.ARPA by SU-AI.ARPA with TCP; 11 Sep 84 00:05:54 PDT
Date: Monday, 10 Sep 1984 21:21-PDT
To: Jeff Ullman <ullman@Diablo>
Cc: cheriton at Pescadero <cheriton@Pescadero>, jmc at Sail <jmc@Sail>
Subject: Re: meeting
In-Reply-To: Your message of Mon, 10 Sep 84 16:02:13 pdt.
From: John Hennessy <jlh@Shasta>
Sounds good. I am free tomorrow morning and late afternoon. I also have
some time early Wednesday. John
∂11-Sep-84 0844 RA
Roberta at Bill Massey's office 7-2232 returned your call.
∂11-Sep-84 1102 JMC*
Blasgen 3478
∂11-Sep-84 1120 EMMA@SU-CSLI.ARPA New mailing list
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Sep 84 11:20:10 PDT
Date: Tue 11 Sep 84 11:17:26-PDT
From: Emma Pease <EMMA@SU-CSLI.ARPA>
Subject: New mailing list
To: initiators@SU-CSLI.ARPA
cc: betsy@SU-CSLI.ARPA, jamie@SU-CSLI.ARPA, ingrid@SU-CSLI.ARPA
I have just created a new mailing list for the initiators (called
Initiators). The people on it are as follows:
Initiators:
BMoore%sri-ai@score,
Bratman@sri-ai,
Bresnan@turing,
Briansmith@Xerox,
Etchemendy@turing,
Goguen%sri-ai@score,
Grosz@Turing,
JMC@su-ai,
John@Turing,
Kaplan@Xerox,
Kay@Xerox,
Kiparsky@csli,
Lauri%sri-ai@score,
Meseguer@sri-ai,
Pentland%sri-ai@score,
Pereira%sri-ai@score,
Peters@Turing,
Rperrault%sri-ai@score,
sag@su-psych,
Stan%sri-ai@score,
Wasow@turing, Wasow@su-psych, Wasow@Xerox,
Winograd@csli,
Witkin@sri-kl
If you feel anyone else should be on the list, please send requests a
message.
-Emma
-------
∂11-Sep-84 1122 IAM
3.00 is fine with me ... is this all 4 or just we 2?..ian
∂11-Sep-84 1440 GOGUEN@SRI-AI.ARPA teaching
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 11 Sep 84 14:40:34 PDT
Date: Tue 11 Sep 84 14:38:51-PDT
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: teaching
To: jmc@SU-AI.ARPA
cc: goguen@SRI-AI.ARPA
John,
I gather from your note that this will apply to the school year 84-85.
However, I was thinking that something conducted in cooperation with CSLI
might occur sometime during this academic year, e.g., as part of the area
CL program. Is it too late for that to be part of the industry lecture
program?
By the way, if you have any questions about the draft material on
algebraic semantics that I sent you earlier, I would be glad to get
together and talk with you, at your convenience.
Cheers,
Joseph
-------
∂11-Sep-84 1504 ERIC@SU-CSLI.ARPA Re: forward mail
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 11 Sep 84 15:04:43 PDT
Date: Tue 11 Sep 84 14:56:34-PDT
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Re: forward mail
To: JMC@SU-CSLI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-CSLI.ARPA>" of Sun 9 Sep 84 13:32:11-PDT
Should be done...
-------
∂11-Sep-84 1520 RA mail
I put urgent mail from Centre Mondial on your desk.
∂11-Sep-84 1522 KAHN@USC-ISI.ARPA Re: Encore vs. HEP
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 11 Sep 84 15:22:35 PDT
Date: 11 Sep 1984 18:22-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: Re: Encore vs. HEP
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA]11-Sep-84 18:22:10.KAHN>
In-Reply-To: The message of 11 Sep 84 1115 PDT from John McCarthy <JMC@SU-AI.ARPA>
JOhn,
id be interested in your rationale for picking hep or anyone
else for that matter. there is some merit in pursuing the hep approach
since it begins to bridge the gap between numeric
and symbolic (and for us thats politically important). On the
other hand gordon is a world class architect and
there could be merit in some of his machines even if
brand spanking new.
id be inclined to encourage both aspects although not necessarily
both in one place at one time.
thanks for alerting me. keep me posted.
bob
Jeff and I met with John Hennessy and Dave Cheriton and both are interested
in the project and in helping evaluate the Denelcor and Encore alternatives.
We will probably visit Denelcor the week of October 8. My and Smith's
trips preclude an earlier visit. Assuming we made up our minds promptly
and produced a proposal, how long would DARPA action take? Incidentally,
I see the project as having substantial personnel costs, and I would have
to hire someone to take Dick Gabriel's place as manager of the project.
∂11-Sep-84 1611 RA
You have reservation at a la carte for 8 for 7:15 tonight. bon apetit.
∂12-Sep-84 0327 SIMONDS@CMU-CS-C.ARPA Re: my next trip to Paris
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 03:27:09 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Wed 12 Sep 84 06:27:33-EDT
Date: Wed 12 Sep 84 06:27:32-EDT
From: Todd.Simonds@CMU-CS-C.ARPA
Subject: Re: my next trip to Paris
To: JMC@SU-AI.ARPA
cc: simonds@CMU-CS-C.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 3 Sep 84 22:06:00-EDT
John,
I'm still here, and will be in some capacity through December. Will
contact you to confirm hotel reservations. Look forward to seeing you.
-- Todd
-------
∂12-Sep-84 1051 RA
Burton Smith called. Would like you to call him back (303) 337 7900.
Says you know what it is about.
∂12-Sep-84 1142 RA
You have a reservation for 4 for 12:15 at the faculty club.
∂12-Sep-84 1213 RA
Burton Smith called again. He'll try again around 1:30.
∂12-Sep-84 1420 ullman@diablo CSD-CF charges
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 14:20:00 PDT
Date: Wed, 12 Sep 84 14:20:34 pdt
From: Jeff Ullman <ullman@diablo>
Subject: CSD-CF charges
To: jmc@sail
I fired off the next message to Bosack.
Since you tend to be interested in such things, I'd
be curious to know your opinion.
∂12-Sep-84 1420 ullman@diablo
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 14:20:16 PDT
Date: Wed, 12 Sep 84 14:20:44 pdt
From: Jeff Ullman <ullman@diablo>
To: jmc@sail
Len, I was just looking over the Navajo rates and something
occurred to me. As you know, I pay a flat rate of about $18K/year
for use of 1/3 diablo. Right now, my students and I have spread
over about 100Mb of diablo. At your proposed rate for Navajo
I would have to pay about $50K/year just for memory.
Of course, if it mattered, I and my students would clean up
their files, and we could probably get down to 10% of that,
which sounds about right, i.e., 5K/year for memory alone
compared with 18K/year total.
The point is, diablo, like navajo, has about 1Gb of disk, and
it would be crazy for me and my students to spend the intellectual
energy worrying about every file we create. On the other hand,
if that were necessary to save $45K/year, we'd have to do it.
The net effect is that everybody thinks that way, and everybody
gets involved in a game of beggar thy neighbor, trying to
make somebody else pay for the disk.
A similar point holds about connect time; I login in the morning
and stay on diablo, often consuming no resources. If I had to
pay for connect time, I'd play that game again; it would be
economically important for me to spend my time logging on and off.
I don't deny that careful accounting for resources is the only
rational policy. However, when it comes to relatively cheap
resources, like disk space, that simplify my life a great deal,
I wonder if there isn't some better way. For example, perhaps
we should be selling flat-rate service to those who want it.
E. g., if you decide you need to make $20K/year selling
disk space on navajo, let me buy 10% of the disk for $3K or $4K,
whether I use it or not.
∂12-Sep-84 1517 ASHOK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 15:16:47 PDT
Date: Wed 12 Sep 84 15:05:27-PDT
From: Ashok Subramanian <ashok@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 12 Sep 84 15:05:00-PDT
Fine
-------
∂12-Sep-84 1531 RA transcriber
Apparenly there is no machine on the market which can take both a
mini and a standard casette. A salesman from Kennedy Office machine
left a transcriber (standard tape) for me to try out. You have to
decide whether you want a mini or a standard. The one he left me
looks has the features I wanted. The price of the toy is $269.23.
∂12-Sep-84 1718 talmy%ucbkim@Berkeley critique of Commonsense Summer
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 17:16:16 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.40/4.38)
id AA06991; Tue, 11 Sep 84 22:54:29 PDT
Received: by ucbkim.ARPA (4.24/4.27)
id AA08377; Tue, 11 Sep 84 22:54:30 pdt
Date: Tue, 11 Sep 84 22:54:30 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8409120554.AA08377@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: critique of Commonsense Summer
Cc: talmy%ucbkim@Berkeley
John--
Jerry asked the participants in Commonsense Summer to write up 2 pages
or so of a critique on the project and suggestions for how it might proceed
if it were to be continued. I thought you might be interested in seeing
a copy of what I wrote. My contribution has grown a bit in length, so hold
on--here comes a mini essay:
Suggestions for the next phase of the Commonsense Project
I see this summer's work as an excellent initial "plowing up of the
ground" pertaining to common sense. All veridically based projects
should begin this way--by taking large and widely distributed
steamshovelsful out of terra incognita to see what kinds of things make
it up and to get the lay of its land. But I do think the next phase should
also include some of the following endeavors:
1) There should be an ongoing project that addresses common sense at
the meta level. It should have two main areas of inquiry: what common
sense is, and how we can get at that:
A) One problem with this summer's approach was that there was no
ongoing discussion on what common sense IS. Due to this absence of
overview, each researcher followed his/her own particular lay sense of
what might be called for. Among others, four questions that needed
asking were: are there different types of common sense? do we assume
that common sense is individual or collective? what is NOT common
sense? what larger cognitive phenomenon is common sense a part of?
I take up these four questions in greater detail here:
A-1) Even minimal inquiry must find that there are competing
candidates for what we could regard as "common sense", representing
different strata of human cognitive organization--and each meriting
investigation. These different forms of common sense would likely be
found to have some degree of functional autonomy, as well as to
interact in a way that constitutes a total "common sense system". Any
project on common sense would do well to clarify which one(s) of these
forms, or their larger interactions, that it was directed toward. Some
candidates for types of common sense are the following:
a) the conceptions that individuals experience consciously in their
explicit understandings of phenomena about themselves and the world
b) unconscious mental models of phenomena which can be inferred to exist
in individuals and on the basis of which the individuals appear to behave
c) the periodic faint hints of intuition that individuals experience as
to how some phenomenon is actually structured, hints that they are
often practiced at either amplifying or disattending to
d) the explicit lore of a culture, as well as its implicit patterns, that
regularly engender in members of that culture particular mental models
and conceptions of the world
e) the apparently inherited and largely unconscious patterns of
perceiving and acting that seem to incorporate some models--perhaps
evolved ones--of how the world and the self are structured.
f) the developmental stages children pass through in their conceptualizations
("theories") about the world, used mainly as an index to rudimentary
un-/conscious mental models that may still play a substantial role in
adult thought
g) the conceptual framework that appears to be built into the semantic
organization of particular languages or of language in general.
A-2) There is the additional issue of whether common sense is assumed
to be constant across individuals or to change from one person to the
next. This summer's research seemed to adopt the former assumption
without question. In my view, the focus differs according to the type
of common sense dealt with. Thus, types (a) through (c) above readily
lend themselves to consideration of individual differences. Thus for
(a), what seems commonsensical--or "obvious"--to one person often
strikes another as nonsense. For example, in the social realm, just
consider the different views of societal structure, dynamics, and
values espoused by Republicans vs. Democrats, each holding their view
to be commonsensical and their opponents to be blind to the obvious.
On the other hand, types (d) through (g) tend to emphasize what is
common across individuals--respectively: culture, inherited
sensorimotor patterns, developmental stages, and language. Of course,
each group of types can be approached from the opposite perspectiive:
types (a)-(c) can be viewed for what they show in common across
individuals, while types (d)-(g) can be studied for their interaction
with individual differences. The point, though, is that the issue of
whether common sense is being treated as cross-personal, individual, or
both, must be made explicit.
A corollary issue inheres in the notion of individual common sense:
can an individual's common sense change or be trained? Take the common
sense notions of the expert/specialist/scientist, for example--have
they developed, or are they the same as before and merely get overlaid
when he acts professionally?
A-3) A third step in clarifying what common sense is, is to distinguish
it from what it is not. Some reflection would presumably make us want
to exclude the following from most notions of common sense:
a) science and the procedures of scientific investigation
--including: constant retesting of the studied object so as to
increase the match between our understanding of it and its actuality.
b) formal systems and models, including mathematics
--In principle, such systems owe nothing to any faithful
representation of something actual; their primary constraint, rather, is
that they be internally consistent within the parameters of their own givens.
c) computer programs
--The functions that such programs are designed to perform may be
intended to coincide with natural functions actually observed, but the
way the programs go about achieving those functions need not correspond
to anything actual.
Corresponding to this nonclarity as to what was and what was not common
sense, was one problem I noticed this summer: Some researchers intermixed,
or went back and forth between, attempts at capturing common sense and
the devising of formal systems that owed nothing beyond internal
consistency, without ever knowing that they'd been crossing an
epistemological chasm in the process (see my mini essay on this below).
A-4) A fourth step in characterizing the quidity of common sense is to
ask the superordinate question: what kind of more general cognitive
phenomenon is it a part of? I believe that what is called for here is a
study of "conceptual structure" in general. Comprehended here are at
least these issues:
a) what is the nature of concepts and of conceptualizing in general?
b) what kinds of relations hold among concepts, including hierarchical
and contingent ones?
c) what are the different ways that incompatible concepts can be held
concurrently by the same individual, and what are the various forms of
reconciliation they can undergo?
[I once organized an interdisciplinary conference with some dozen
presenters on "Conceptual Structure". In my opening remarks, I
presented a framework on the nature of conceptual structure, and I'd be
glad to discuss this with you some time if you're interested.]
B) The second area of meta inquiry should be that of methodology. That
is, with particular types of common sense identified as of concern to
us, how do we go about determining their nature? The problem with this
summer's procedure was that there was no check on how the researchers
came up with the results presented as commonsensical. In practice, the
researchers drew on a melange composed of intuitions as to what were
commonsense notions, of formal-systems/mathematics-based organization
of concepts, and of language-based organization of concepts--the
particular proportions within this mix depended on the individual
researcher. Largely missing, though, was appeal to the standard
methods of other disciplines or the use of information-gathering
methods, such as systematically questioning uninvolved individuals for
their commonsense notions about things, and recording the results for
later analysis (as, say, Gentner did with her mental model research).
The methods one would use for a more rigorous approach to mapping out
commonsense notions depend on the particular type of common sense
addressed. Thus, corresponding to the types in (A-1) above are these
methods:
a') [An inquiry into individuals' consciously available conceptions can
be gotten at with] the methods developed in some branches of psychology,
e.g., the use of protocols recorded from a range of subjects
articulating their beliefs in response to questioning.
b') [Individuals' unconscious models underlying their behavior can be
gotten at with] other psychological methods, e.g., those involving
experimental setups in which one observes people's behaviors in
response to certain prepared stimulus situations.
c') the researchers' own introspection or interviews with individuals
who have innovated--going against prevailing assumptions about
things--to ask them how the ideas occurred to them.
d') the methods of cultural anthropolgy/sociology--including cultural
analysis and the recording of explicitly expressed lore about things
(for us, this could include nursery rhymes/Aesop fables & pop magazines, etc.)
e') findings pulled together from psychophysics and kinesics, as well
as from evolution theory and Kantian/Fodorian categories
f') the findings of conceptual developmentalists like Jean Piaget and
the many more recent researchers
g') the methods of natural language semantics
2. To the extent that a domain can be divided into matters of structure and
those of process, this summer's research into common sense mainly
involved structure. That is, it came up with components that comprise
certain common sense areas and the relations that these components bear
to each other. What I think needs to be added for future research is
consideration of process. For the domain of common sense, what this
would mainly involve is commonsensical REASONING/INFERENCING and
commonsensical EXPLORATION.
By commonsensical reasoning and inferencing, I mean the way that the
average person in his everyday mode cognitively interacts through time
with the phenomena of the world and the self: placing them in
categories, generating new categories when necessary, projecting their
future behavior, monitoring their actual behavior, recategorizing them
if there is a mismatch, fitting smaller perceived phenomena together
into assemblies or gestalts with properties of their own, projecting the
effects of causal impingements (including those initiated by oneself)
even where these constitute a concurrent set of mutual influences, etc.
(This is the kind of material that Marc and I began to work on and sent
you some notes on.)
By commonsensical exploration, I mean the way that the average person
in his everyday mode explores some new situation (whether external
[say, physical or social] or internal [say, psychological or
theoretical]) to determine what elements are present, what their
properties are, and how they can be interacted with to achieve some
goal. One way researchers can get at this is to have subjects enter a
room with objects of unusual shape and behavior properties, instructed
to accomplish some task. The subjects could be watched and questioned
for their ways of learning about phenomena in a common sense way.
(Annette Karmiloff-Smith's work on how children learn about balancing
objects is relevant here).
3. While the weekly meetings and your oversight went some way toward
creating a unified direction of research, I think more could be done.
The meetings were a great forum for information-dispensing as well as
for brainstorming and debate. Still, the separate projects had much
the character of being separate projects. If this enterprise is to emerge
with some coherent view of what common sense consists of and what to do
with that, then some additional interaction needs to be planned in. I
think the researchers ought to be asked to meet by themselves, both in
smaller groups and in their whole number, so as to hash out their
common areas and problems and directions. This would be especially
effective if, in addition to the individual project workers, you
included some who were to address the macroscopic issues of common
sense, i.e., those outlined in (1) and (2) above.
4. Here's the mini essay I referred to earlier on the epistemology of
scientific endeavors. The issues bear, I believe, on the character of
the research any future commone sense project may undertake.
There are two quite different types of endeavor that involve the
sciences of the mind and of the computer, and these two are too often
not clearly distinguished in AI work.
a) In the first type, there is some actually existing real entity of
interest to us, where the task is to investigate it so as to discover
its true characteristics and properties. The entity can be a physical
one, say, crystals and their structure. Or it can be a cognitive
one--say, word meanings as experienced by introspection, or commonsense
notions as held by an individual, or the contents of consciousness.
Both kinds of entities are on the same epistemological footing: the
researcher has to go to where the entity is and probe it--whether he
has to walk over to, say, a crystal and apply his (instrument-amplified)
senses to it, or introspect on his experiences of, say, word meanings.
In any discussion among researchers of this first type, there is a
simple principle that guides the progression of the discourse: are we
getting closer to the truth?
b) In the second type of endeavor, there is the goal of creating an
entity that will manifest certain desired properties--such as,
performing certain tasks. In our context, the main examples are
writing a program or constructing a formal model to satisfy certain
goals. Some workers aim to tailor the structure of their creations
after presumed patterns of human cognition, while others consider this
irrelevant as long as the output is the desired one. For either
approach, however, the crucial thing is not to uncover some portion of
reality but to fashion something with a particular behavior. The
governing principle is whether or not the construction "works".
Discussion among workers of this type is guided not by whether one gets
closer to some truth, but rather closer to something that works.*
Now, both of these endeavors are worthy, and each is necessary. And
some projects must involve the two together. The problem is when a
worker does not maintain a clear realization of when he is doing the one
and when the other, producing instead an entangled melange.
* A personal note: In discussions in my own field of linguistics, I
feel I have a clear basis for agreeing or disagreeing with the last
statement someone has made: is it true or not? But I must confess some
mystification when I sit in on AI discussions: I do not know what
principles guide the participants in their moment-to-moment agreements
and disagreements, even though they seem quite in tune with each
other. I have tentatively concluded that they share a particular mix
of assumptions about logical formalisms, traditions of approach in
computer implementation, and insight into some actual domains of
phenomena.
∂12-Sep-84 1847 halpern.sjrlvm1%ibm-sj.csnet@csnet-relay.arpa conference description + list of names
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 12 Sep 84 18:47:43 PDT
Received: From ibm-sj.csnet by csnet-relay; 12 Sep 84 20:55 EDT
Date: Wed, 12 Sep 84 11:16:46 PDT
From: Joe Halpern <halpern%ibm-sj.csnet@csnet-relay.arpa>
To: JMC@su-ai.arpa
Subject: conference description + list of names
CC: bmoore@sri-ai.arpa, levesque@sri-ai.arpa, fischer@yale.arpa,
vardi@su-aimvax.arpa
Here is the proposal for the workshop on knowledge, as well as
a (tentative!) list of participants. Please feel free to make
any comments on anything. Since I'll be leaving town next Saturday,
I would appreciate it if you could make the comments as soon as
possible. -- Joe
Workshop on Theoretical Aspects of Reasoning About Knowledge
Formal models for reasoning about knowledge have been studied by
philosophers since the early 1960's (cf. .LBKHi.RBK). Reasoning about
knowledge and knowledge representation has also been an issue
of concern in Artificial Intelligence for over two decades
(cf. .LBKMH,MSHI,Mo.RBK). Over the past few years interest
in knowledge has heightened in
the AI and philosophy communities as researchers
have realized the importance
of non-monotonicity in commonsense reasoning (cf. .LBKMc,MD,NM.RBK).
Even more recently, researchers
in other subfields of computer science, including
cryptography, distributed computation, and database theory, have
become aware of the important role of reasoning about knowledge (cf.
.LBKFHV,HM.RBK). For example, a number of workers are beginning
to agree that the right way to understand and specify distributed
protocols is by understanding how they change the state of knowledge
of a system.
The idea of having this workshop grew out of a series of seminars
organized by the PI at IBM Research, San Jose. Originally intended
to be a small research seminar, we had a mailing list of well over
250, and had an average of 40 enthusiastic
attendees at each seminar. (The seminars
were held every other week, usually with two speakers, followed by
discussions over lunch.) The speakers and audience included
mathematicians, computer scientists, philosophers, and linguists.
Given the evident interest in the area by such diverse groups,
a workshop seemed appropriate, particularly one that would increase the
awareness of workers in one field of the work done in the others.
We hope to hold such a workshop (in Asilomar, on Nov. 11-14).
By keeping the number of attendees small, roughly 60-70, we
hope that many fruitful interactions will occur. In order
to give structure to the workshop, we plan to have roughly
20-25 talks, including 3 invited talks of one hour in length,
and about 20 half-hour talks chosen by a program committee from
submitted papers (a tentative committee is given at the end).
To emphasize the interdisciplinary nature of the field, we hope to
have three invited speakers: Ron Fagin, John McCarthy, and Jaakko
Hintikka, one from each of the main
research groups (theoretical computer science, artificial intelligence,
and philosophy respectively).
We hope to choose the remaining papers in such
a way that they will be of interest to all groups. Major topics
of interest include:
Semantic models for knowledge and belief.
Resource-bounded knowledge (appropriate for modelling reasoners with
limited reasoning power and reasoning about cryptographic protocols).
Using knowledge to specify and reason about distributed systems.
Common knowledge in distributed systems.
Nonmonotonic reasoning and commonsense knowledge.
We hope to allow enough time between the talks during the conference
for private discussions and small group meetings. In order to
ensure that the workshop remains relatively small, attendance will
be limited to invited participants (see tentative list attached) and
authors of accepted papers. To help ensure that those invited will be
able to attend, we hope to be able to pay for all local expenses
of each of the attendees, as well as to help pay for transportation
costs in special cases. (**Suggestions for how to do this would be
nice...**)
Here is a tentative list of invited participants. This is meant to be
neither an inclusive nor an exclusive list. The names in parentheses
are the ones that I'm most unsure of. Since we don't want to have
too many people at the conference, I'd like to keep the total
number of invited participants down to under 45, in the hopes that
about 30 will attend. (Note that means there are already too many
names on the list.) I'd appreciate further suggestions for names
to add and drop.
Artificial Intelligence
Jon Doyle, CMU
(David Etherington, UBC)
(Michael Georgeff, SRI)
Victor Guo, Stanford/Peking University
(David Israel, BBN)
Kurt Konolige, SRI
Hector Levesque, Fairchild
John McCarthy, Stanford
Drew McDermott, Yale
Ray Reiter, UBC
Bob Moore, SRI
(Fernando Pereira, SRI)
(Stan Rosenschein, SRI)
M. Sato, Kyoto
(Stuart Shapiro, SUNY Buffalo)
(Richard Stark, Florida)
Philosophy
Jon Barwise, Stanford
Nuel Belnap, Pittsburgh
(Daniel Dennett, Tufts)
Fred Dretske, ?
Dov Gabbay, Bar Ilan
Peter Gardenfors, Lund?
Jaakko Hintikka, Florida?
Saul Kripke, Princeton
Fred Landman, Amsterdam
Wolfgang Lenzen, Regensburg?
(K. Lehrer, ?)
John Perry, Stanford
Nicholas Rescher, Pittsburgh
(Aaron Sloman, Essex)
(E. Sosa, ?)
Robert Stalnaker, Cornell
R. Thomason, Pittsburgh
(Johan van Benthem, Amsterdam)
Theoretical Computer Science
(including Cryptography, Distributed Systems, and Databases)
Mani Chandy, U. of Texas, Austin
Danny Dolev, Hebrew University
Cynthia Dwork, MIT
Ron Fagin, IBM San Jose
Mike Fischer, Yale
Shafi Goldwasser, MIT
Joe Halpern, IBM San Jose
Neil Immerman, Yale
(Dexter Kozen, IBM Yorktown Heights)
(Richard Ladner, U. of Washington)
(Leslie Lamport, SRI)
Daniel Lehmann, Hebrew University
(Witold Lipski, Warsaw?)
Nancy Lynch, MIT
Silvio Micali, MIT
Jay Misra, U. of Texas, Austin
Yoram Moses, Stanford
(Mike O'Donnell, Johns Hopkins)
Rohit Parikh, CUNY/Brooklyn College
Michael Rabin, Harvard/Hebrew University
Ron Rivest, MIT
(Fred Schneider, Cornell)
(Dana Scott, CMU)
Ray Strong, IBM San Jose
(Les Valiant, Harvard)
Moshe Vardi, Stanford
Very tentative program committee
Michael Fischer, Yale
Joe Halpern, IBM San Jose
Hector Levesque, Fairchild
Bob Moore, SRI
Rohit Parikh, CUNY/Brooklyn College
Robert Stalnaker, Cornell
Richmond Thomason, Pittsburgh
Moshe Vardi, Stanford
Bob Moore suggested replacing Stalnaker and Thomason by David Israel
and John Perry. I'm quite comfortable with that, but open to other
suggestions of philosophers/AI people. -- Joe
∂12-Sep-84 2113 JK
I came up with a somewhat simpler axiomatisation for
functions; in fundef.lsp[ekl,jk]. It is still too unwieldy.
(1) In order to deal with unnecessarily restrictive type
checking for list types one has to create a new tuple operation.
(2) For the same reason all function are made to look like
functions of one variable only.
(3) The unification mechanism does not understand properties
of tupling in EKL and full high order matching.
All of this can be fixed, and the results would be rather interesting.
It would mean that almost all term manipulation can be handled explicitly
using tupling and high order unification. So the question is more general
than just function definition. However, the solution would entail
(a) a redesign of EKL handling of list types.
(b) a redesign of the unifier.
∂13-Sep-84 0657 SIMONDS@CMU-CS-C.ARPA Re: my next trip to Paris
Received: from CMU-CS-C.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 06:57:29 PDT
Received: ID <SIMONDS@CMU-CS-C.ARPA>; Thu 13 Sep 84 09:57:51-EDT
Date: Thu 13 Sep 84 09:57:50-EDT
From: Todd.Simonds@CMU-CS-C.ARPA
Subject: Re: my next trip to Paris
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 3 Sep 84 22:06:00-EDT
John,
Yes, we have made reservations at the Bristol for you and Caroline for
the 18th thru 22nd inclusive. Bon voyae.
-- Todd
-------
∂13-Sep-84 0707 KAHN@USC-ISI.ARPA
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 07:07:03 PDT
Date: 13 Sep 1984 10:07-EDT
Sender: KAHN@USC-ISI.ARPA
From: KAHN@USC-ISI.ARPA
To: JMC@SU-AI.ARPA
Cc: kahn@USC-ISI.ARPA
Message-ID: <[USC-ISI.ARPA]13-Sep-84 10:07:09.KAHN>
In-Reply-To: The message of 12 Sep 84 2004 PDT from John McCarthy <JMC@SU-AI.ARPA>
John,
Im not sure howlong it would take but probably
a minimum of a month in darpa plus whatever the
agent takes. how much were you expecting was
the minimum in personnel costs fully loaded?
Please let me know how the denelcor and encore
discussions go too.
bob
∂13-Sep-84 0830 JK
∂12-Sep-84 2119 JMC
I presume that this is impractical in the short time before you
go into business. Perhaps it is even uninteresting to you. What do
you think about the possibility or desirability that Gianluigi be
persuaded to do it, with some voluntary supervision from you?
Chen turns out to be the supervisor of the grant, but I haven't
talked to him yet about whether allowing the grant to be partially
suspended for a year is something he can and would do.
-------------
This in fact is of interest to me. I have talked to Gianluigi and asked
him to come up with a detailed report on what he would like to change
in EKL. Once that is done, I am planning on introducing him to the guts
of EKL. Joe can help in this, too, if he is around. I would be glad to
supervise him.
∂13-Sep-84 0901 RA Your sept 17 trip
Are there any travel arrangements to be taken care of?
∂13-Sep-84 0919 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley panel discussion at San Jose
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 09:19:22 PDT
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA13217; Thu, 13 Sep 84 09:18:58 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA15267; Thu, 13 Sep 84 08:37:41 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA12517; Thu, 13 Sep 84 08:33:46 pdt
Date: Thu, 13 Sep 84 08:33:46 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8409131533.AA12517@ucscg.UCSC>
To: jmc@su-ai
Subject: panel discussion at San Jose
Cc: ornstein.pa@xerox
Terry will talk to Stefik today when he (Stefik) returns to town.
There is a problem about getting a room on Oct. 3 so if S. can do
it on Oct. 1 we'll go with that date. You should thus hear very
soon about the exact date.
∂13-Sep-84 1118 RA Gross Dictionary of Music
John Cib from Stanford bookstore called. $2001.00 is indeed the current
price for the dictionary. He is at 329 1217 ext.33. If you call him and
he doesn't answer you can wait for the operator to come on and take a message.
∂13-Sep-84 1131 RA Your car
Call Gary at the shop that's taking care of your car 494 7676
∂13-Sep-84 1334 RINDFLEISCH@SUMEX-AIM.ARPA HPP Input for HEP Proposal
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 13:33:58 PDT
Date: Thu 13 Sep 84 13:34:22-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: HPP Input for HEP Proposal
To: JMC@SU-AI.ARPA
cc: Rindfleisch@SUMEX-AIM.ARPA, Feigenbaum@SUMEX-AIM.ARPA, Nii@SUMEX-AIM.ARPA
John, following is a page of HPP material for your protoproposal to Bob Kahn
for the HEP facility. Let us know how things go.
Tom R.
----------------
Heuristic Programming Project Use of a
Stanford HEP Computing Resource
Edward A. Feigenbaum
The Stanford Heuristic Programming Project (HPP) has proposed to do advanced
research for a new generation of computer system architectures aimed at
concurrent symbolic processing in knowledge-based systems under the DARPA
Strategic Computing Program. This work will be driven by applications
involving signal and situation understanding and information fusion. It will
investigate possible concurrencies in the application domain, the organization
and use of knowledge and problem solving strategies, the implementation
languages and systems (including language primitives and allocation
mechanisms), and the underlying computing hardware.
In this effort we will emphasize the development of an overall system
architecture targeted at a specific, interesting class of applications and
driven by its needs rather than study a particular machine design to see what
application problems it is good for. This means our work will depend heavily
on emulations of alternative architecture designs to perform necessary
evaluation studies. From this work we expect to produce engineering analyses
of expert system performance in multiprocessor environments together with a
methodology to accomplish such analyses and a future generation expert system
building tool to construct concurrent knowledge-based systems.
Our approach will be to study systems that use the blackboard problem solving
framework (Erman, Hayes-Roth, Lesser, and Reddy 1980; Nii, 1980) -- initially,
the HASP sonar signal understanding program (Feigenbaum and Nii 1982) and other
applications as they become available. This powerful framework provides a way
for many different types of knowledge sources to contribute jointly to a
problem solution using various kinds of symbolic reasoning. This structure
naturally admits the exploitation of concurrency at various levels of system
granularity. We plan to implement the concurrent blackboard system we design
(including, for example, knowledge sources, control system, and blackboard
objects) using evolutions of the QLambda concurrent Lisp system (Gabriel and
McCarthy 1984). By simulating QLambda-like implementations on various hardware
architectures and evaluating performance of the concurrent blackboard system
under various models of system granularity, topology, and communications
characteristics, we can develop specifications of optimal system designs for
effective concurrency.
In our initial simulations, we plan to use Symbolics 3600 Lisp machines with
the 3600 QLambda implementation and Palladio, a knowledge-based execution
simulator for architectural designs (Brown, Tong, and Foyster, 1983). We
expect the simulation runs on the Lisp machines to be increasingly long (days
or weeks) as our work progresses because of the serial nature and limited speed
of the machines and the increasing complexity of the concurrent architectures
to be investigated. Without improved computational capacity, this will place a
definite limit on the scope of the studies we can practically perform.
In the formulation of our Strategic Computing proposal, however, we could not
justify the cost or managerial complexity involved in acquiring, developing,
and operating a more capable system like the HEP multiprocessor machine for our
project alone. Needless to say, it would greatly expedite our planned work to
have access to McCarthy's proposed shared HEP resource and the QLambda
implementation that would be available on it. This would benefit our work in
two ways; first by allowing direct experience on the HEP machine, a system with
limited concurrency with on the order of 10 processors and shared memory, and
second by allowing faster emulation and study of alternative, more complex
architectures involving much larger numbers of processors.
We therefore strongly support Professor McCarthy's plan for the shared
HEP/QLambda resource at Stanford.
-------
∂13-Sep-84 1351 RA
Katie would like to know what to do with the mail addressed to people
in the AI lab which used to be in this building. She thought you might
know.
∂13-Sep-84 1515 RA
I got your tickets.
∂13-Sep-84 1544 RA
Roy Ohlander returned your call. His # 202 694 5051.
∂13-Sep-84 1600 CLT
ive gone home to practice - call me if you want to go for your car
∂13-Sep-84 1652 BSCOTT@SU-SCORE.ARPA Gunnar Sjodin
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 16:52:39 PDT
Date: Thu 13 Sep 84 16:51:01-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Gunnar Sjodin
To: JMC@SU-AI.ARPA
cc: BScott@SU-SCORE.ARPA
John, do you by chance have office space where Dr. Sjodin might sit for
the year?
Betty
-------
∂13-Sep-84 1713 BSCOTT@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 17:13:10 PDT
Date: Thu 13 Sep 84 17:11:52-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 13 Sep 84 16:56:00-PDT
John, I don't want to belabor the point of Sjodin's visit here, office space
or anything else. I was not aware of the precise arrangements. However, I
understood that you were hosting this person's visit, and that $4,500 had
been deposited to your unrestricted account to pay for any department expense
which might be incurred, e.g., CSD-CF, etc.
It just seemed to me that because of these arrangements, Sjodin probably would
sit somewhere in your area. But I think I hear you saying you never agreed
to provide space.
It will be helpful to me to know just what responsibility you agreed with Gene
to accept for Sjodin's visit.
Thank you.
Betty
-------
∂13-Sep-84 2134 chertok%ucbkim@Berkeley UCB Cognitive Science Seminar--Sept. 18
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 13 Sep 84 21:34:43 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.31)
id AA02766; Thu, 13 Sep 84 12:17:44 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA09663; Thu, 13 Sep 84 11:44:53 pdt
Date: Thu, 13 Sep 84 11:44:53 pdt
From: chertok%ucbkim@Berkeley (Paula Chertok)
Message-Id: <8409131844.AA09663@ucbkim.ARPA>
To: cogsci-friends%ucbkim@Berkeley
Subject: UCB Cognitive Science Seminar--Sept. 18
BERKELEY COGNITIVE SCIENCE PROGRAM
Fall 1984
Cognitive Science Seminar -- IDS 237A
We are presenting a mini-series on the theme of ``common-
sense'' with the talks scheduled for this and the following
week.
TIME: Tuesday, September 18, 11 - 12:30
PLACE: 240 Bechtel Engineering Center
DISCUSSION: 12:30 - 2 in 200 Building T-4
SPEAKER: Jerry R. Hobbs, Artificial Intelligence
Center, SRI International and Center for the
Study of Language and Information, Stanford
University
TITLE: Report From Commonsense Summer
ABSTRACT: ``Commonsense Summer'' was a summer-long
workshop sponsored by the Center for the
Study of Language and Information at Stan-
ford University and held at SRI Interna-
tional. It has long been agreed that intel-
ligent behavior requires a great deal of
knowledge about the commonsense world, but
before this year no one had embarked on a
large-scale effort to encode this knowledge.
The aim of Commonsense Summer was to do the
first three months of such an effort. Eight
graduate students from several universities
participated in the workshop full-time, and
a number of other active researchers in the
fields of knowledge representation, natural
language and vision participated as well.
An attempt was made to axiomatize in formal
logic significant amounts of commonsense
knowledge about the physical, psychological
and social worlds, concentrating on eight
domains: spatial relationships, shape,
motion, properties of materials, belief
states, certain speech acts, relations
between textual entities and entities in the
world, and responsibility. In this talk I
will discuss the problem of encoding common-
sense knowledge in general, outline the
approach taken in the workshop, and describe
some of the results of the summer.
SEPTEMBER 25: John McCarthy of the Computer Science
Department at Stanford University returns
to speak on ``What is Commonsense Think-
ing?''
------------------------------------------------------------
Our memo will now be including announcements of other talks
relevant to Cognitive Science that are upcoming on the
Berkeley campus, as information on them becomes available to
us sufficiently in advance.
UPCOMING ELSEWHERE ON CAMPUS
COGNITIVE PSYCHOLOGY GROUP SEMINAR:
September 21, 4 pm, 3105 Tolman Hall
Susan Benloucif will be speaking on a topic relat-
ing to the biology of memory.
∂14-Sep-84 0800 JMC*
Ohlander and Chen.
∂14-Sep-84 0821 GARDNER@SUMEX-AIM.ARPA CBCL
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 08:19:47 PDT
Date: Fri 14 Sep 84 08:20:06-PDT
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: CBCL
To: jmc@SU-AI.ARPA
Last week I sent you a message about the possibility of working on
CBCL this next year. Do you think we should talk about it?
Anne
-------
gardner%sumex
cbcl
Can you come in this afternoon? I'll be away next week. 3pm would be
good, but any time is ok.
∂14-Sep-84 0824 BSCOTT@SU-SCORE.ARPA Re: sjoddin
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 08:23:49 PDT
Date: Fri 14 Sep 84 08:22:30-PDT
From: Betty Scott <BSCOTT@SU-SCORE.ARPA>
Subject: Re: sjoddin
To: JMC@SU-AI.ARPA
cc: BSCOTT@SU-SCORE.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Thu 13 Sep 84 18:23:00-PDT
O.K., John. Thanks.
Betty
-------
∂14-Sep-84 1052 RA Students' appointments
I need for you to confirm and let me know what kind of appointments
the following students have for the coming year:
Casley, Ross 50% Research Assistant
Mason, Ian Has a fellowship with the Philosophy Dept.
Bellin, Gianluigi Teaching Assistant in the Fall. Is this 50%?
What about the rest ofthe year?
Weening, Joseph
Moses, Yoram
Talcott, Carolyn 50%
∂14-Sep-84 1147 JK Lucid
phone number 424-8855
address 1090 East Meadow Circle, Palo Alto 94303
∂14-Sep-84 1202 RA
Hurd called. He'll be back at 1:30. Please call 494 3612
∂14-Sep-84 1208 RA
George Minot from Compusur called (614) 457 8600 re AI project that they
have there. please call.
∂14-Sep-84 1259 minker@maryland Exchange Papers
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 12:56:19 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA12675; Thu, 13 Sep 84 17:00:38 edt
Date: Thu, 13 Sep 84 17:00:38 edt
From: minker@maryland (Jack Minker)
Message-Id: <8409132100.AA12675@maryland.ARPA>
To: Barwise%su-csli.arpa.csnet-relay@csnet-relay.ARPA,
Reiter.Ubc@csnet-relay.ARPA, decvax\!watmath\!mhvanemden@Berkeley,
henschen@ANL-MCS.ARPA, jmc@su-ai
Subject: Exchange Papers
Cc: minker@maryland
Larry Henschen has suggested that if you all have papers related
to the talk that you will give at our AI and Logic Week, that
you send a copy to one another before you arrive here. Don and I
believe that this is a good idea. Don and I thought that to start
the process we would send you a paper that we would discuss
assuming there is interest and time available. Enclosed is a
copy of the paper. If you wish to have a hard copy sent to you,
please let us know. All addresses on the Net appear on the
headers and if you need the mailing addresses you can request them from
either us or the individual over the Net.
Enclosed also is a copy of Jon Barwise's abstract. We will send you
McCarthy's abstrac as soon as we receive it.
Publicity has gone out and you should have received several copies
of the flyer that we have mailed.
Best regards,
Jack
--------------------------------------------------------------------
Constraint Logic
Jon Barwise
Constraint Logic is based on a semantics that grew out of
situation semantics, but on a syntax similar to that from first-order
logic. The semantics is carried out not in set theory, as is usual in
logic, but in a richer theory I call situation theory, a theory about
things like situations, roles, conditions and constraints. While the
syntax is not so unusual looking, the connection between the syntax
and semantics is much more dynamic than is traditional in logic, since
the interpretation assigned to a given *use* of some expression will
depend on context, in particular, on the history of the "session".
For example, variables are interpreted as denoting roles, but
different uses of a given variable x may denote increasingly
constrained roles as a session proceeds. This is one of the features
that makes constraint logic interesting with regard to AI in general
and with regard to non-monotonic logic in particular.
--------------------------------------------------------------------
.nf
Circumscription: Finitary Completeness Results
Jack Minker and Donald Perlis
Computer Science Department
University of Maryland
College Park, MD 20742
June 1984
Abstract
We investigate the model theory of the notion of circumscription,
and find a completeness theorem that provides a partial converse
to a result of McCarthy. We show that the circumscriptive
theorems are precisely the truths of the minimal models, in the
case of \'finitary\' theories.
1. Introduction
McCarthy [1980] provides the soundness half of a model theory for
circumscription, but not the completeness half. Nonetheless Minker [1982]
has a soundness and completeness result for the highly analogous situation
of generalized closed world assumptions. Here we look for a parallel to
Minker\'s work in restricted cases, and obtain both soundness and
completeness results for certain cases of circumscription (and also for
protected circumscription as in Minker and Perlis [1983, 1984a,b]). We
assume that the reader is familiar with these concepts, but briefly describe
them in section 2.
2. The Idea of Circumscription and Protected Circumscription
We review briefly the idea of circumscription. Given a predicate
symbol P (other than the equality predicate symbol) and a formula A[P]
containing P, the circumscription of P by A[P] can be thought of as saying
that the P-things consist of certain ones as needed to satisfy A[P] and no
more, in the sense that any P-things Z satisfying A[Z] already include ALL
P-things:
P
C [Z]: [A[Z] & (x)(Z(x)-->P(x))] --> (y)(P(y) --> Z(y)).
A
A key example, emphasized by McCarthy, is the following: let A[P]
be P(a) v P(b). Let Z1(x) be x=a and Z2(x) be x=b. Then from P(a) v P(b)
we get that either Z1 or Z2 can serve for circumscription, i.e., either P(x)
--> Z1(x) or P(x) --> Z2(x). Thus either a is the only P-thing, or b is:
-P(a) v -P(b). We will use this idea later.
As another example, let A[P] be -P(a) v Q. Then -P(a) is a result
of circumscription of P by A[P]. For let Z(x) be x=a & P(x). Then it is
easy to see that A[Z] holds. Furthermore, Z(x) --> P(x) trivially. Thus by
circumscription we have P(x) --> Z(x) and so we get P(x) --> x=a, i.e.,
-P(a). So -P(a) v Q is redundant, since -P(a) is already a result of
circumscription from the empty set.
In the case of protected data, we desire to circumscribe the
predicate symbol P in an axiom A, except that we wish to protect the
uncertainty of certain items, say those with property S. We show in Minker
and Perlis [1983, 1984] that a simple syntactic device will yield the
desired result in such cases. To accomplish the protection desired, we
alter McCarthy\'s circumscription schema to read as follows:
P/S
C [Z]: [A[Z] & (x)(Z/S(x)-->P(x))] --> (y)(P/S(y) --> Z(y))
A
for all predicate symbols Z. (Here P/S(x) means P(x) & -S(x).)
Intuitively, we are saying that conclusions are drawn only about
non-S-things, as far as ruling out possible P-things goes. We refer to this
schema as \'protected circumscription\'; unless so indicated, circumscription
will refer to McCarthy\'s schema. We write C[Z] when context makes clear
what the A, P, and S (if protected) are.
4. Completeness Results
In McCarthy [1980] the concept of minimal model was discussed in the
context of circumscription. We must re-define minimal model in a manner
appropriate to the new version of circumscription. Let M and N be models of
A[P] with the same domains. We say M <P/S N if the atomic truths of M are
contained in those of N, if those atomic truths of M not using P are
precisely those of N, and if the extension of P&S in M is also that in N.
Then M is a P/S-minimal model of A[P] if M is a model of A[P] minimal with
respect to the relation <P/S. This incidentally shows the necessity of not
allowing P to be the equality predicate, for the interpretation of equality
is simply identity, and identical elements cannot be made non-identical and
yet preserve the model domain.
We begin by restating a result sketched in McCarthy [1980] and
detailed in Minker and Perlis [1983] for both protected and regular
circumscription.
Theorem 1: A[P] |P/S-- B implies A[P] |P/S= B for any formula B, where the
P/S double-turnstile means the consequent holds in any P/S-minimal
model of the antecedent, and L and S are any formulas not involving
P. (When we intend ordinary circumscription we will write A[P] |c=
B to mean B holds in any minimal model of A[P], and A[P] |c-- B to
mean B is a circumscriptive theorem of A[P].)
Unfortunately the converse does not hold, as shown by Davis [1980].
Let A[N] be Peano arithmetic (with the postulate N(0) & (x)(N(x)-->N(x+1))).
Then the minimal models contain N-extensions isomorphic to the natural
numbers, so that the formulas B relativized to N that are true in these
models are precisely those which are true in arithmetic. But no recursive
first-order theory, including one of the form A[N] + {C[Z]}, has as its
theorems precisely those sentences true of the natural numbers, nor even its
N-relativized theorems.
However, we shall show that a \'finitary\' converse does hold, which
seems more useful than one given by Davis.
To show the converse, we will attempt to use Z(x) in the form
x=c1 v x=c2 v ... v x=ck
where the cj are all the Herbrand constants to which P \'must\' apply. This
is where our assumption of finiteness comes in. In fact the actual
situation will be slightly more complicated, but suggested by these
comments.
Lemma 1: If A[P] |c= B then B is true in all finite models of A[P] +
{C[Z]}, where B is an arbitrary formula.
Proof: In effect, we must show that if B is true in all minimal models of
A[P], then it also is true in all finite \'circumscriptive\' models of
A[P], i.e., finite models of A[P] plus the circumscriptive schema
{C[Z]} where Z ranges over all formulas in the language L of A[P].
Let T be the theory A[P] + {C[Z]}*, where the star indicates that
the Z predicates are to be only (disjunctions of) equalities over L.
We will show N |= B for any finite model N of T. Note that we
require far more than that N be a model of A[P]; for the additional
{C[Z]}* schema will have the effect of producing circumscription
within its models, and this turns out to be just what produces
minimality in the finitary case.
Moreover, any circumscriptive model of A[P] is also a model of T,
since the former is a model of C[Z] for all Z over L, while the
latter need only be a model of C[Z] for equalities and disjunctions
Z. Of course, not every model of A[P] alone is a model of T, let
alone a circumscriptive model of A[P].
We will proceed by showing that if a finite model N of A[P] is not
minimal, then it is not circumscriptive. This will show that all
circumscriptive finite models are minimal and hence satisfy B.
Let then N be a finite model of A[P], and suppose N is not minimal;
then N has a submodel N\' in which all predicates other than P have
the same extension as in N, and yet the extension C of P in N\'is a
proper subset of its extension in N:
C = {c1,...,cn} = {x in dom(N): N\' |= P(x)}
Also for some b, N |= P(b) and N\' |= -P(b), so that
b=c1,...,b=cn. Form Z(x): x=c1 v ... v x=cn. Then Z(b) is
false in both N and N\' (indeed Z has the same extension in both N
and N\'). Also, P(x)<-->Z(x) in N\'.
We proceed to circumscribe using this Z(x). First, we show that
A[Z] holds in N. But A[P] holds in N\', and so then must A[Z] since
P(x)<-->Z(x) in N\'. Now since A[Z] has the same meaning in both N
and N\' (no P\'s are left in this formula) then also A[Z] is true in
N.
Next we see that Z(x)-->P(x) in N. But this is trivial since we
already have P(c1),...,P(cn) in N, and Z(x) is x=c1 v...v x=cn. Now
if we circumscribe, we get P(x)-->Z(x) in N. As a consequence,
P(b)-->Z(b) in N. But P(b) is true in N, and Z(b) is false, which
is a contradiction. It follows that the circumscriptive axiom
(A[Z] & (Z(x)-->P(x))) --> (P(x)-->Z(x))
is false in N, i.e., N is not circumscriptive. (Note that this is a
correct use of a Z predicate, even though the constants ci may not
be in the language L; for we can start with the formula x=y1 v ...
v x=yn, which is in L, and instantiate the constants ci for the
variables yi once we pass to the model N.)
Now we can conclude that B holds in all finite circumscriptive
models N of A[P], for we have just seen that any such model is
minimal, and the hypothesis of our lemma is that B holds in minimal
models of A[P].
As an illustration of the above argument, consider the axiom A[P]:
Q(b) & (x)(Q(x) --> P(x)).
(We are indebted to Ray Reiter for this example.) Let N be {Q(b) P(b)
P(a)}. Then N clearly is not minimal, for N\' = {Q(b) P(b)} is a proper
submodel of N. N also is not circumscriptive, as is seen by considering
Z(x): x=b. The formula C[Z] then becomes false in N, for A[Z] and
Z(x)-->P(x) are true there, while P(x)-->Z(x) is not.
Pursuing this example further, we note that using Z(x) to be Q(x)
allows a quick (circumscriptive) derivation that P(x) --> Q(x). Yet our
lemma above employs only equalities and disjunctions for Z, suggesting that
P(x) --> Q(x) may not be obtainable by the method of the proof. This in
fact is the case.
One might object that by adding a further axiom such as
(P(x)-->Q(x)) --> B would provide a counterexample to our proof, in that
circumscription with Z as Q would seem still to yield P(x)-->Q(x) and then
the new axiom would in turn produce for us the result B. This then would be
true in all minimal models of this new A[P] and in finite circumscriptive
models as well, even though equalities and disjunctions alone (in this case
x=a, x=b, and x=a v x=b are the only possibilities) cannot achieve this
result. But in fact using Q for Z will also achieve nothing once the new
axiom is added to A[P]. For it then becomes necessary to verify
(Q(x)-->Q(x))-->B, i.e, B itself must be a theorem first, in which case
nothing remains to be done by circumscription.
Now we can establish a variety of completeness theorems:
Theorem 2: If A[P] has only finite models, then for all
sentences B, A[P] |c= B iff A[P] |c-- B.
Proof: The right-to-left order of entailment we have already shown in
Theorem 1. Let us proceed to the converse. If A[P] |c-- B, then B
holds in all finite circumscriptive models of A[P] by Lemma 1.
Since all models of A[P] are finite, then in fact B holds in all
circumscriptive models of A[P], i.e., A[P] + {C{Z]} |c= B, so by
the completeness theorem of first-order logic, A[P] |c-- B.
This result is not as restrictive as it may sound. In many
applications, it is perfectly appropriate to assume that the universe is
finite and that there is a (possibly implicit) axiom to the effect that
there are at most Max objects in the universe. (See Reiter (1980) for
another view of this sort.) However, we can easily extend the result to
certain infinite universes as well, namely ones in which the extension of
the predicate P remains finite. This we amplify in several results which
follow.
Corollary: If the extension of P is finite in every circumscriptive model
of A[P] then for all sentences B, A[P] |c= B iff A[P] |c-- B.
Proof: The same as for Theorem 2, noting that Lemma 1 requires only that
the P extension be finite in each circumscriptive model of A[P].
Definition: A theory T is P-finite if it has the axiom (or theorem)
Pn: (Ey1...yn)(x)(P(x) --> x=y1 v ... v x=yn)
for some n. A model M is P-finite if the extension of P in M is
finite. We call such an axiom Pn as above a P-finiteness axiom.
Corollary: If A[P] is P-finite, then A[P] |c= B iff A[P] |c-- B.
Proof: By the above definitions, if A[P] is P-finite, then the extension of
P is finite in every model of A[P], hence in particular in every
circumscriptive model, so by the previous corollary we are done.
Now usually we will not explicitly have A[P] given as P-finite, even
if that may be the intent. So we consider the following, which
characterizes provability with any assumed degree of P-finiteness whatever.
Definition: If T is a theory, then T |P-- B (B is a P-finite consequence of
T) if for every P-finite extension T\' of T, T\' |-- B.
Thus, T |P-- B means that B is provable from T and the assumption of
finiteness of the extension of P:
T + Pn |-- B for any n.
Lemma 2: M is a P-finite model of T iff M is a model of some P-finite
extension of T.
Proof: M is P-finite iff M is a model of one of the \'P-finiteness\'
formulas Pn, which means M is a P-finite model.
Corollary: Let T be a theory and B a sentence of T. Then T |P-- B iff B is
true in all P-finite models of T.
Proof: From the completeness theorem for first-order theories: if B is
true in all P-finite models of T and if M is a model of a P-finite
extension T\' of T, then M is P-finite so M |= B, hence T\' |-- B.
This means T |P-- B. For the converse, we have T\' |-- B for all
P-finite extensions T\' of T, so if M is a P-finite model of T then M
is a model of some such T\' and thus M |= B, yielding the result.
We write T |P= B to indicate B is true in all P-finite models of T,
and A[P] |Pc= B to indicate B is true in all P-finite minimal models of
A[P].
Note that this notion captures the idea that the extension of P be
finite, without explicitly fixing a maximum cardinality for that extension.
In effect, rather than represent B as a consequence of one infinitary
disjunction
(Ey1)(x)(x=y1) v (Ey1 y2)(x)(x=y1 vx=y2) v ... |-- B
stating that the world is P-finite, we use a conjunction which can be
written separately:
(Ey1)(x)(x=y1) |-- B
and (Ey1 y2)(x)(x=y1 v x=y2) |-- B
and ...
This seems then to provide a plausible notion of circumscription in
domains intended to be finite although arbitrarily large, namely, A[P] +
{C[Z]} |P-- B says that B is provable (by circumscription) given any
assumption of finitude of the extension of P. This then yields the
following result.
Corollary: If A[P] |c= B then A[P] + {C[Z]}* |P-- B (and of course then
also A[P] + {C[Z]} |P-- B as well).
Proof: Immediate from the above discussion and the proof of Lemma 1.
Theorem 3: A sentence B holds in the P-finite minimal models of A[P] iff it
holds in the P-finite circumscriptive models of A[P], i.e, iff A[P]
+ {C[Z]} |P-- B.
Proof: Immediate.
(We will henceforth write A[P] |Pc-- B for A[P] + {C[Z]} |P-- B.)
This then provides a soundness and completeness result for \'finite\'
circumscription. The applicability of this result should be broad. Except
in the case of deliberate reference to infinite structures such as the
integers, it is usually entirely within the scope of the intended domains
that the entities enjoying a property P be finite in number, although
possibly not fixed in number in advance. E.g., the set of people, though
undeniably finite, may grow indefinitely over time. This provides no
difficulty for us here: we simply let P(x) say x is a person, and examine
the P-finite models of the axioms to determine the P-finite consequences of
circumscribing these axioms. To be sure, if it is desired to suppose that
every person has a predecessor who is also a person, and that \'predecessor\'
is transitive and antisymmetric, then we have in effect the integers again.
We comment on this kind of situation more in the next section.
Our results show incidentally that finitary circumscribing will
never lead to information that cannot be obtained by circumscribing with the
above disjunctions of equalities of constants in finite models to determine
the atomic theorems, and then simply inferring the more general formulas
true in these models for the rest, although we do not suggest that this is a
practical way to circumscribe. In fact the completeness results offer a
convenient manner to determine finitary circumscriptive theorems, as will be
illustrated below.
Reiter [1982] addresses the problem of selecting appropriate formulas Z,
in his work relating circumscription and the closed world assumption using
ideas in Clark [1978]. Here we have provided some insight into the manner
in which certain fundamental Z\'s operate. McCarthy [1980] uses two
examples to illustrate circumscription and chooses judiciously a disjunction
in one and multiple cases for Z in the other; we have used exactly these
situations to show that all circumscriptive theorems are characterizable
this way, although further ingenuity may be needed in envisioning all finite
models. Nonetheless, the completeness results show that the P-finite
minimal models of A[P] determine the circumscriptive theorems, in analogy
with the work of Reiter and Clark but for arbitrary formulas (not just Horn
clauses).
Let us again consider Reiter\'s example: Q(b) & (x)(Q(x)-->P(x)).
All models of this sentence have the form
{Q(b) P(b) Q(c1) P(c1) Q(c2) P(c2) ... P(d1) P(d2) ...}
where there may be an infinite number of c\'s and d\'s. Any minimal model
clearly has this form where there are no d\'s, and any such model is minimal.
It follows from Theorem 3 that any sentence B true in these minimal models
is also provable by circumscription with an assumption of P-finitude, what
we might call finitary circumscription. This includes the sentence
(x)(P(x)-->Q(x)), for it is true in each minimal model, and therefore in
each P-finite minimal model.
Indeed, if we take finitary circumscription as a concept in its own
right, or even as a possible intended sense of McCarthy\'s original concept,
then we obtain a full completeness theorem, in which the appropriate notion
of model is that of a P-finite minimal model (indicated by a Pc-double
turnstile):
Theorem 4. For any theory A[P], we have
A[P] |Pc-- B iff A[P] |Pc= B.
Proof: If A[P] |Pc-- B then B holds in all models of A[P] together with the
circumscriptive schema for A[P] and any P-finiteness axiom Pn. But
any P-finite minimal model is of this sort. Now for the converse,
if A[P] |Pc= B then B holds in all P-finite minimal models of A[P];
but as we saw earlier, any P-finite circumscriptive model of A[P] is
already minimal, hence B holds in all models of A[P] + Pn + {C[Z]}.
As a consequence, A[P] + Pn + {C[Z]} |-- B, i.e., A[P] |Pc-- B.
It is of interest to note an infinitary interpretation of this
result. If we write A[P] + \\/Pn as our P-finite version of A[P], where the
infinite disjunction is over all natural numbers n, we intuitively capture
the desired sense that the extension of P is finite, without having to
specify (an upper bound on) the cardinality of that extension. In this case
we could write
A[P] + \\/Pn |c-- B iff A[P] + \\/Pn |c= B
assuming the corresponding infinitary model and proof theory could be made
to mimic our above development. This is currently under investigation.
We note finally that the above results also hold for the protected
form of circumscription, giving in particular the following:
Theorem 5: If A[P] |P/S= B then T |P/S-- B in all P-finite extensions T of
A[P] + {C[Z]}*.
Proof: We essentially repeat the proof of the previous results, with minor
alterations, especially in Lemma 1, which we therefore detail here:
Lemma 3: If A[P] |P/S= B then B is true in all finite models of A[P]
+ {C[Z]}, where B is an arbitrary formula.
Proof: Let T be the theory A[P] + {C[Z]}*, where the star indicates that
the Z predicates are to be only (disjunctions of) equalities over L.
We will show N |= B for any finite model N of T. Any (protected)
circumscriptive model of A[P] is also a model of T, since the former
is a model of C[Z] for all Z over L, while the latter need only be a
model of C[Z] for equalities and disjunctions Z.
We will proceed by showing that if a finite model N of A[P] is not
P/S minimal, then it is not circumscriptive. This will show that
all circumscriptive finite models are P/S minimal and hence satisfy
B.
Let then N be a finite model of A[P], and suppose N is not P/S
minimal; then N has a submodel N\' in which all predicates other than
P have the same extension as in N, and yet the extension C of P in
N\' is a proper subset of its extension in N:
C = {c1,...,cn} = {x in dom(N): N\' |= P(x)}
Also for some b, N |= P/S(b) and N\' |= (-P)/S(b), i.e., N |=
P(b)&-S(b) and N\' |= -P(b)&-S(b) (recall that all predicates other
than P have the same extensions in N and N\'), so that
b=c1,...,b=cn. Form Z(x): x=c1 v ... v x=cn. Then Z(b) is
false in both N and N\' (indeed Z has the same extension in both N
and N\'). Also, P(x)<-->Z(x) in N\'.
We proceed to circumscribe using this Z(x). First, we show that
A[Z] holds in N. But A[P] holds in N\', and so then must A[Z] since
P(x)<-->Z(x) in N\'. Now since A[Z] has the same meaning in both N
and N\' (no P\'s are left in this formula) then also A[Z] is true in
N.
Next we see that Z/S(x)-->P(x) in N. But this is trivial since we
already have P(c1),...,P(cn) in N, and Z(x) is x=c1 v...v x=cn. Now
if we circumscribe, we get P/S(x)-->Z(x) in N. As a consequence,
P/S(b)-->Z(b) in N; but we already have N |= P/S(b) and N |=
-Z(b), which is a contradiction. It follows that the
circumscriptive axiom (A[Z] & (Z/S(x)-->P(x))) --> (P/S(x)-->Z(x))
is false in N, i.e., N is not circumscriptive.
Now we can conclude that B holds in all finite circumscriptive
models N of A[P], for we have just seen that any such model is
minimal, and the hypothesis of our lemma is that B holds in minimal
models of A[P].
It is straightforward now to prove Theorem 5.
It is instructive to consider the following example: Let A[P]
consist of the data P(a), -P(b) v -P(c). Then there are three models of
A[P] (ignoring extraneous constants, an implicit finiteness assumption):
1. {P(a)}
2. {P(a), P(b)}
3. {P(a), P(c)}
Of these, only 1 is minimal, and so the formulas true in 1 are the
circumscriptive theorems of A[P], for all choices of Z at once! Notice that
the theory A\'[P] having ONLY P(a) as axiom also has these three models as
well as: 4. {P(a), P(b), P(c)} which still is not minimal. So A and A\'
have the same minimal models and hence the same circumscriptive theorems.
In fact in both theories we have the theorems -P(b) and -P(c), so that the
axiom -P(b) v -P(c) in A is circumscriptively redundant.
Now suppose we wish to protect b and c in A, by asserting S(b) and
S(c), so that ALL we know about P(b) and P(c) is that they are not jointly
true, i.e., -P(b) v -P(c) represents real uncertainty. Then we find that 1,
2, and 3 where S(b) and S(c) are included, are the only models and all are
minimal. Furthermore, although -P(b) v -P(c) holds in each, neither -P(b)
nor -P(c) does, so that the protection has really worked. But now if we
pass to A\', i.e., P(a) as given above, and protect b and c, we find still
all four models, each augmented by S(b) and S(c) as before and all are
minimal, so that not even -P(b) v -P(c) holds.
Whereas the unprotected A and A\' have the same minimal models, the
protected versions have different minimal models and different
circumscriptive theorems. Although the completeness result has shown us
what the theorems of these four theories are, we see from this example that
negative data (-P(b) v -P(c)) can have a non-redundant effect when there are
protected constants. This shows a strong distinction with the situation for
ordinary circumscription.
4. Conquest of the Infinite
We are left then with the problem of infinite P extensions. We know
[Davis 1980] that in general there is no solution to the completeness issue
in the usual form. Indeed, it may be the case that every infinite P
extension spells trouble. For instance, consider the axioms
Q(b)
P(a)
P(x) --> P(f(x))
where P(x) may mean x is a predecessor (of a fixed person) and f(x) may
return the father of x. Q can be any other predicate--e.g., Q(b) may say b
is happy. Now we may wish to conclude -P(b) by circumscription, in the
sense that the only things guaranteed to be predecessors by the axioms are
a, f(a), f(f(a)), ... .
However, it is not obvious that circumscription will produce the
indicated result. Since now there are infinitely many constant terms, we can
no longer form the disjunctions that were so useful before:
x=a v x=f(a) v x=f(f(a)) v ...
We need a way to refer to all the predecessors at once, other than the
question-begging one of using P itself. No first-order formula seems to be
available for this purpose (again it would be tempting to consider an
infinitary formulation of this) even though negation by failure will produce
-P(b), suggesting a possible fundamental difference between circumscription
and negation by failure in the infinite case. We can try, nonetheless, to
introduce a new predicate symbol \'f-pred\' that is intended to apply
precisely to these predecessors: f-pred(x,y) means x is one of y, f(y),
f(f(y)), etc. The additional axioms that will augment A[P] are:
f-pred(x,x)
f-pred(x,y) --> f-pred(f(x),y)
f-pred(x,a) --> P(x)
and - f-pred(b,a).
Note that the third axiom states that in fact all predecessors of
\'a\' have property P, which we already knew from the original axioms P(a) and
P(x) --> P(f(x)). However, in this new form, we implicitly force f-pred to
take on more of its intended meaning as applying ONLY to predecessors. In
fact we are creating in effect a minimal yardstick, f-pred, by which to
compare P. Normally this is done by a constructed formula Z(x), and in the
present case the obvious one would be infinitary, so instead we invent a new
one. To be more explicit about it, we might in fact \'invent\' a new schema
to produce the third axiom above as a consequence:
[R(a) & (x)(R(x)-->(R(f(x)))] --> (x)[f-pred(x,a)-->R(x)]
where R represents any formula. This schema is itself a minimality
condition, saying that f-pred is the least predicate (extensionally
speaking) applying to the predecessors of \'a\'.
Now taking Z(x) to be f-pred(x,a), we easily obtain by ordinary
circumscription on the augmented A[P], first that
- f-pred(w,a) --> -P(w)
and then that -P(b), since we have - f-pred(b,a). If on the other hand it
is desired to obtain -P(f(f(...f(b)...))) for all such terms at once, then
note that altering the second new axiom above to read
f-pred(x,y) <--> f-pred(f(x),y)
does the trick; the biconditional will push the negative as well as the
positive conclusions through iterated f-images.
Now, what are the minimal models of this extended theory? Clearly
all will contain P(a), P(f(a)), etc, as well as Q(b). Furthermore, none
will contain P(b), P(f(b)), etc, as long as no equalities between a\'s and
b\'s occur (which is the case in our simple example that has no \'=\' symbol).
So in fact the proof theory and model theory are behaving as we would expect
from a completeness theorem: we are getting the same result from the
minimal models as from the circumscriptive schema, namely, -P(b).
The above can lead to the objection that we must add highly
non-trivial new axioms to A[P] in order to effect this situation. But this
can be countered by the observation that with any decent amount of set
theory the above predicate f-pred can in effect be forced to exist in the
form of a set which is the inductive closure of the constant a under the
function f. While this requires some reformulating of the language, a
modest amount of set theory does seem to reasonably fall under the rubric of
general world knowledge. If this approach is adopted, then in fact unaided
circumscription will produce the conclusion P(b) --> Z(b) where Z(x) says x
is in the inductive closure of a under f.
What does this tell us? It appears there is interesting terrain for
investigation in the semantics of circumscription for infinite predicate
extensions. In particular, two things stand out as goals for further work:
to determine a general method for extending or transforming a theory into
one for which completeness may hold (we have suggested set theory as one
possibility here), and to determine the limitations of such a method
(presumably it would fail for Davis\' example of arithmetic).
Acknowledgements
Our work obviously depends greatly on that of John McCarthy. We have also
benefitted crucially from discussions with Ray Reiter. This paper was
written with support from the following grants:
AFOSR-82-0303, for J. Minker and D. Perlis
NSFD MCS 79 19418, for J. Minker
U. of Md. Summer Research Award, for D. Perlis.
Bibliography
Clark, K. [1978] "Negation as Failure", In: Logic and Databases,
(Gallaire, H. and Minker, J., Eds.) Plenum Press, NY 1978,
293-322.
Davis, M. [1980] "The Mathematics of Non-Monotonic Reasoning".
Artificial Intelligence 13 (1980), 73-80.
McCarthy, J. [1980] "Circumscription--A Form of Non-Monotonic
Reasoning". Artificial Intelligence 13 (1980), 27-39.
Minker, J. [1982] "On Indefinite Databases and the Closed-World
Assumption". Springer-Verlag Lecture Notes in Computer Science,
v.138, 292-308. Sixth Conference on Automated Deduction. New
York, NY. 1982.
Minker, J. [1983] "On Theories of Definite and Indefinite Databases".
Tech. Report. Univ. of Maryland
Minker, J. and Perlis, D. [1983] "On the Semantics of Circumscription".
Tech. Report. Univ. of Maryland
Minker, J. and Perlis, D. [1984a] "Protected Circumscription".
Submitted for publication.
Minker, J. and Perlis, D. [1984b] "Applications of Protected
Circumscription". Springer-Verlag Lecture Notes in Computer
Science, v.150, 414-425. Seventh Conference on Automated
Deduction. New York, NY. 1984.
Reiter, R. [1978] "On Closed World Databases". In: Logic and Data
Bases, (Gallaire, H. and Minker, J., eds.) Plenum, 1978, 55-76.
Reiter, R. [1980] "Equality and Domain Closure in First-Order
Databases". JACM 27, 2 (April 1980), 235-249.
Reiter, R. [1982] "Circumscription Implies Predicate Completion
(Sometimes)". Proceedings of AAAI-82, 418-420.
∂14-Sep-84 1259 GARDNER@SUMEX-AIM.ARPA Re: cbcl
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 12:59:40 PDT
Date: Fri 14 Sep 84 12:59:58-PDT
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Re: cbcl
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 14 Sep 84 09:18:00-PDT
I'll be there about 3. Thank you.
Anne
-------
∂14-Sep-84 1344 RA
Hurd called again at 1:45pm. His number 494 3612. He is back in his
office, please call.
∂14-Sep-84 1622 GARDNER@SUMEX-AIM.ARPA Re: SRI
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 16:22:23 PDT
Date: Fri 14 Sep 84 16:22:40-PDT
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Re: SRI
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 14 Sep 84 15:36:00-PDT
Fine, thank you very much.
--Anne
-------
∂14-Sep-84 1649 BARWISE@SU-CSLI.ARPA Area F Co-ordinator
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 16:45:44 PDT
Date: Fri 14 Sep 84 16:45:11-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Area F Co-ordinator
To: F1@SU-CSLI.ARPA, F2@SU-CSLI.ARPA, F3@SU-CSLI.ARPA, F4@SU-CSLI.ARPA
cc: Stucky@SU-CSLI.ARPA
Area F-ers,
The project leaders and I met yesterday decided that David Israel will
be the area F co-ordinator for this year. This makes area F the first
to get organized for the year, so we can expect all that much more
work.
Jon
-------
∂14-Sep-84 1717 EMMA@SU-CSLI.ARPA recent rumor
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 14 Sep 84 17:17:15 PDT
Date: Fri 14 Sep 84 17:15:50-PDT
From: Emma Pease <EMMA@SU-CSLI.ARPA>
Subject: recent rumor
To: researchers@SU-CSLI.ARPA
The research committee mailing list is now called RC as well as
rsch-comm. The Research mailing list is also called Researchers.
Good mailing,
Emma
-------
∂15-Sep-84 0934 GARDNER@SUMEX-AIM.ARPA Re: fellowship opportunity
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 15 Sep 84 09:34:39 PDT
Date: Sat 15 Sep 84 09:35:03-PDT
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Re: fellowship opportunity
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 14 Sep 84 22:20:00-PDT
Many thanks for the idea. I hadn't heard of those fellowships, but
I'll inquire right away.
Anne
-------
∂16-Sep-84 1814 ornstein.PA@Xerox.ARPA Re: panel discussion at San Jose
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 16 Sep 84 18:14:30 PDT
Received: from Cabernet.MS by ArpaGateway.ms ; 16 SEP 84 18:15:09 PDT
Date: Sun, 16 Sep 84 18:14 PDT
From: ornstein.PA@XEROX.ARPA
Subject: Re: panel discussion at San Jose
In-reply-to: <8409131533.AA12517@ucscg.UCSC>
To: ucscc!beeson%ucscg.ucscc.UUCP@UCB-VAX.ARPA (20012000)
cc: jmc@SU-AI.ARPA, ornstein.PA@XEROX.ARPA
Oct 1 is OK with me if that's the best time for everyone else.
S.
∂16-Sep-84 2200 JK reminder
chien at 11am 202-357-7345
∂17-Sep-84 0730 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa joint work
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 07:30:11 PDT
Received: From ibm-sj.csnet by csnet-relay; 17 Sep 84 10:17 EDT
Date: Mon, 17 Sep 84 09:11:58 EDT
From: mike blasgen <BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa>
To: jmc@su-ai.arpa
Subject: joint work
john, i have spoken to lots of people in ibm. everyone
believes that the work is important and that there will
be no problem in obtaining the funds. problems, if there
are any, are likely to be in the contractual area (patents,
etc.) and the concommitant(sp?) delay. but things look good.
mike
∂17-Sep-84 0800 JMC*
Roy Ohlander returned your call. His # 202 694 5051.
∂17-Sep-84 0928 EDMISTEN@SUMEX-AIM.ARPA SIGLUNCH ANNOUNCEMENT FOR 9/21/84
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 09:28:22 PDT
Date: Mon 17 Sep 84 09:24:32-PDT
From: Paula Edmisten <Edmisten@SUMEX-AIM.ARPA>
Subject: SIGLUNCH ANNOUNCEMENT FOR 9/21/84
To: SIGLUNCH@SUMEX-AIM.ARPA
cc: Edmisten@SUMEX-AIM.ARPA
There will be no SIGLUNCH again this Friday. Thank you,
Paula
-------
∂17-Sep-84 0939 MORGAN@SU-CSLI.ARPA Appointment papers
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 09:39:33 PDT
Date: Mon 17 Sep 84 09:37:18-PDT
From: Nannette Morgan <MORGAN@SU-CSLI.ARPA>
Subject: Appointment papers
To: research@SU-CSLI.ARPA
I'm doing appointment papers for you re: your upcoming seminar here and
need some info. not supplied by your cv: date of birth, place of birth,
nationality(ie citizenship). Please reply asap. Thanks.
-------
∂17-Sep-84 1024 RESTIVO@SU-SCORE.ARPA paper trails
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 10:24:29 PDT
Date: Mon 17 Sep 84 10:22:31-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
Subject: paper trails
To: jmc@SU-AI.ARPA
cwr - have received the stanford application. if you are still willing to
help, would it be alright to stop by your office this week and talk
about it?
-------
∂17-Sep-84 1030 JMC*
Chien
∂17-Sep-84 1100 JMC*
Chien
∂17-Sep-84 1106 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 11:05:51 PDT
Date: Mon 17 Sep 84 11:04:20-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 17 Sep 84 10:53:00-PDT
cwr - next week then.
-------
∂17-Sep-84 1146 RA Talk about common sense in the Law School
Tom Heller teaches in the Law School. He teaches a acourse in AI
application in the legal profession. Following Ann Lander suggestion,
he is wondering whether you will be willing to give a talk on common
sense on November 14. His extention numbeer is 7-3501.
∂17-Sep-84 1334 RINDFLEISCH@SUMEX-AIM.ARPA TI Open House at ACM
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 13:34:47 PDT
Date: Mon 17 Sep 84 13:34:57-PDT
From: T. C. Rindfleisch <Rindfleisch@SUMEX-AIM.ARPA>
Subject: TI Open House at ACM
To: HPP-Exec@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA, TOB@SU-AI.ARPA, RPG@SU-AI.ARPA,
Reges@SU-SCORE.ARPA, SU-BBoards@SUMEX-AIM.ARPA
cc: Golub@SU-SCORE.ARPA, Rindfleisch@SUMEX-AIM.ARPA
As a follow-up to the technical presentation at Stanford on September 6 by
Texas Instruments on their new Explorer Lisp Machine, several machines will be
on public display at the SF Hilton during the October ACM meeting.
Tentatively, Monday night, October 8, is to be a Stanford open house at the
Hilton between 5:00 and 8:00. Some hands-on access will be possible in
addition to talks with TI hardware and software experts.
Tom R.
PS: For those who haven't heard about the Explorer, it is similar to the LMI
Lambda but reengineered by TI for volume production.
-------
∂17-Sep-84 1356 ullman@diablo HEP proposal
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 13:55:54 PDT
Date: Mon, 17 Sep 84 13:56:40 pdt
From: Jeff Ullman <ullman@diablo>
Subject: HEP proposal
To: jmc@sail, kahn@isi
The next message contains a brief description of the research
that I would like to try on the HEP if funding were available.
∂17-Sep-84 1356 ullman@diablo
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 13:56:19 PDT
Date: Mon, 17 Sep 84 13:57:06 pdt
From: Jeff Ullman <ullman@diablo>
To: jmc@sail, kahn@isi
The HEP would be used by Jeff Ullman to implement a language
consisting of Horn-clause logic (i.e, ``pure Prolog'') on
top of a relational database system. Qlambda would be used
as the implementation language. This language is a natural
one to attempt, because it generalizes the mechanisms incor-
porated into present-day relatioal systems for such purposes
as integrity and security, view definition and management,
and multi-database access. Further, it provides the power
of symbol-manipulation languages not normally possessed by
relational query languages.
Briefly, goals (predicates) correspond in this language
to queries. Goals are expanded top-down, as in Prolog, but
in all possible ways; there is no notion of sequential exe-
cution of rules or goals. Goals that can be resolved in
terms of the database are resolved and turned into relations
over their free variables. Relations propagate up the tree
of rules and goals, with the union operator implementing
alternative rules and the natural join implementing the con-
junction of goals (terms, or predicates) on the right sides
of rules.
Certain aspects of a parallel implementation on the HEP
would be quite easy. For example, the semantics of the
language are such that independent goals are routinely
spawned; there is no need for ``killing'' processes once
spawned, and the results of two goals can always be computed
independently. The HEP architecture makes it relatively
easy to catch the common situation where logically
equivalent goals are spawned, and such goals can be combined
into one. Much of the work performed by programs written in
this language would be in the form of join computations, and
these are not hard to parallelize given the HEP architec-
ture.
On the other hand, there are some hard aspects of the
implementation. We wish to remove from the user the respon-
sibility of process management found in Qlambda, so we need
to provide near-optimal methods for managing the operations
of expanding goals and computing joins. The question of
passing information ``sideways'' presents a major optimiza-
tion problem. As the result of one goal becomes known, the
answer restricts the portion of the answer to sibling goals
(that share one or more variables) that is interesting. We
need to automate a mechanism for restricting already-spawned
goals to limit the amount of useless work that is done solv-
ing them. In effect, this problem is akin to the problem of
killing spawned processes that have been found useless, but
it is more general, in that (a) we do not know a priori when
a goal becomes useless, and (b) it is typical that a goal
does not become entirely useless, but must be resticted at
run-time to produce only the interesting subset of what it
was originally intended to produce.
It must be noted that there are certain other problems
that must be solved, although they are not impacted by the
need for parallelism in the HEP implementation. In particu-
lar, recursive rules force us to be very careful about the
order in which we treat goals. It is necessary for the com-
piler to detect in advance situations in which a particular
set of evaluation methods will not converge, and this detec-
tion must be done efficiently. Some ideas for handling the
planning of queries have been developed recently [1, 2], the
``capture rule'' approach, in which strictly limited amounts
of information about rules and goals are made available in a
query-planning phase.
←←←←←←←←←←←←←←←←←←←←←←←←←
[1] J. D. Ullman, ``Logical query languages for data-
base systems,'' STAN-CS-84-1000, 1984.
[2] Y. Sagiv and J. D. Ullman, ``Analysis of a top-down
capture rule,'' STAN-CS-84-1009, 1984.
∂17-Sep-84 1426 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa contract
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 14:26:13 PDT
Received: From ibm-sj.csnet by csnet-relay; 17 Sep 84 17:16 EDT
Date: Mon, 17 Sep 84 16:37:40 EDT
From: mike blasgen <BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa>
To: jmc@su-ai.arpa
Subject: contract
it would be a help to me if you made a proposal
that has a paragraph or two of technical information
and a paragraph or two of financial requirements.
this does not have to be a formal thing, but i am
getting questions about the cost, and the years that
the costs would be incurred, and when the effort would
start and stop, and what checkpoints are defined.
thanks mike
∂17-Sep-84 1450 KAHN@USC-ISI.ARPA hep package
Received: from USC-ISI.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 14:50:04 PDT
Date: 17 Sep 1984 17:49-EDT
Sender: KAHN@USC-ISI.ARPA
Subject: hep package
Subject: [Jeff Ullman <ullman@diablo>]
From: KAHN@USC-ISI.ARPA
To: jmc@SU-AI.ARPA
Message-ID: <[USC-ISI.ARPA]17-Sep-84 17:49:55.KAHN>
john,
Is this the entire package or just jeffs part?
IF theres more (i expect there is) i
wonder if you could collect the whole set of inputs,
distill them as you collectively think wisest and
send the whole package to me?
Id appreciate it if you could.
thanks
bob
Begin forwarded message
Received: FROM SU-AIMVAX.ARPA BY USC-ISI.ARPA WITH TCP ; 17 Sep 84 16:57:02 EDT
Date: Mon, 17 Sep 84 13:57:06 pdt
From: Jeff Ullman <ullman@diablo>
To: jmc@sail, kahn@isi
Return-Path: <ullman@diablo>
The HEP would be used by Jeff Ullman to implement a language
consisting of Horn-clause logic (i.e, ``pure Prolog'') on
top of a relational database system. Qlambda would be used
as the implementation language. This language is a natural
one to attempt, because it generalizes the mechanisms incor-
porated into present-day relatioal systems for such purposes
as integrity and security, view definition and management,
and multi-database access. Further, it provides the power
of symbol-manipulation languages not normally possessed by
relational query languages.
Briefly, goals (predicates) correspond in this language
to queries. Goals are expanded top-down, as in Prolog, but
in all possible ways; there is no notion of sequential exe-
cution of rules or goals. Goals that can be resolved in
terms of the database are resolved and turned into relations
over their free variables. Relations propagate up the tree
of rules and goals, with the union operator implementing
alternative rules and the natural join implementing the con-
junction of goals (terms, or predicates) on the right sides
of rules.
Certain aspects of a parallel implementation on the HEP
would be quite easy. For example, the semantics of the
language are such that independent goals are routinely
spawned; there is no need for ``killing'' processes once
spawned, and the results of two goals can always be computed
independently. The HEP architecture makes it relatively
easy to catch the common situation where logically
equivalent goals are spawned, and such goals can be combined
into one. Much of the work performed by programs written in
this language would be in the form of join computations, and
these are not hard to parallelize given the HEP architec-
ture.
On the other hand, there are some hard aspects of the
implementation. We wish to remove from the user the respon-
sibility of process management found in Qlambda, so we need
to provide near-optimal methods for managing the operations
of expanding goals and computing joins. The question of
passing information ``sideways'' presents a major optimiza-
tion problem. As the result of one goal becomes known, the
answer restricts the portion of the answer to sibling goals
(that share one or more variables) that is interesting. We
need to automate a mechanism for restricting already-spawned
goals to limit the amount of useless work that is done solv-
ing them. In effect, this problem is akin to the problem of
killing spawned processes that have been found useless, but
it is more general, in that (a) we do not know a priori when
a goal becomes useless, and (b) it is typical that a goal
does not become entirely useless, but must be resticted at
run-time to produce only the interesting subset of what it
was originally intended to produce.
It must be noted that there are certain other problems
that must be solved, although they are not impacted by the
need for parallelism in the HEP implementation. In particu-
lar, recursive rules force us to be very careful about the
order in which we treat goals. It is necessary for the com-
piler to detect in advance situations in which a particular
set of evaluation methods will not converge, and this detec-
tion must be done efficiently. Some ideas for handling the
planning of queries have been developed recently [1, 2], the
``capture rule'' approach, in which strictly limited amounts
of information about rules and goals are made available in a
query-planning phase.
←←←←←←←←←←←←←←←←←←←←←←←←←
[1] J. D. Ullman, ``Logical query languages for data-
base systems,'' STAN-CS-84-1000, 1984.
[2] Y. Sagiv and J. D. Ullman, ``Analysis of a top-down
capture rule,'' STAN-CS-84-1009, 1984.
--------------------
End forwarded message
∂17-Sep-84 1621 ullman@diablo Bell grant
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 16:21:25 PDT
Date: Mon, 17 Sep 84 16:22:06 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Bell grant
To: gardner@score, jmc@sail, tw@sail
Anne, it looks like you have a number of fans.
In order for me to sort things out in time, I need to know
what it is YOU want to do. Of course, I cannot guarantee that
Bell would support any particular activity, but proposing you
for two different ones is a sure way to have this whole thing
backfire.
∂17-Sep-84 1852 GARDNER@SUMEX-AIM.ARPA Re: Bell grant
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 18:51:36 PDT
Date: Mon 17 Sep 84 18:52:10-PDT
From: Anne Gardner <GARDNER@SUMEX-AIM.ARPA>
Subject: Re: Bell grant
To: ullman@SU-AIMVAX.ARPA
cc: jmc@SU-AI.ARPA, tw@SU-AI.ARPA
In-Reply-To: Message from "Jeff Ullman <ullman@diablo>" of Mon 17 Sep 84 16:35:42-PDT
If it's up to me to choose, I would have to go with Terry's project.
We have worked together for a long time; I have some emotional
investment in the book already; and I would very much like to master
all that material on semantics. The last might even put me in a
better position, in the long run, to make a real contribution to
John's CBCL.
--Anne
-------
∂17-Sep-84 2026 ullman@diablo Bell
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 17 Sep 84 20:25:58 PDT
Date: Mon, 17 Sep 84 20:25:54 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Bell
To: gardner@sumex, jmc@sail, tw@sail
Under the circumstances, it seems that Anne and Terry ought to
start drafting a proposal.
Remember, there are still more proposals than awards, so nothing
guaranteed.
I still have not heard from Aho.
∂18-Sep-84 1038 SHORTLIFFE@SUMEX-AIM.ARPA AAAI-M representative to AAMSI Congress
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 18 Sep 84 10:38:21 PDT
Date: Tue 18 Sep 84 10:38:36-PDT
From: Ted Shortliffe <Shortliffe@SUMEX-AIM.ARPA>
Subject: AAAI-M representative to AAMSI Congress
To: jmc@SU-AI.ARPA
Office: Room TC-135, Stanford Med Center; Phone: (415) 497-6979
John,
I just received a copy of the letter to you from Ben Williams requesting
that Perry Miller be designated the official representative from the
AAAI on the AAMSI Congress program committee. You will recall that I performed
this function the last few years. This is to confirm that I support the
appointment of Perry to this role; in fact, I suggested that he replace me
on the committee. Perhaps you'd forward the letter (and this message) to
Woody Bledsoe so that he can confirm to Ben Williams the official "approval"
of this assignment.
Regards,
Ted
-------
∂18-Sep-84 1114 JAMIE@SU-CSLI.ARPA Message from Nannette Morgan
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Sep 84 11:13:59 PDT
Date: Tue 18 Sep 84 11:11:19-PDT
From: Jamie Marks <JAMIE@SU-CSLI.ARPA>
Subject: Message from Nannette Morgan
To: research@SU-CSLI.ARPA
Please ignore the recent message from Nannette about appointments.
It wasn't meant for everyone.
-------
∂18-Sep-84 1347 BARWISE@SU-CSLI.ARPA Guggenheim applications
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 18 Sep 84 13:47:45 PDT
Date: Tue 18 Sep 84 13:45:26-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Guggenheim applications
To: Research@SU-CSLI.ARPA
I got a notice today from the University of the deadline for
Guggenheim applications -- which is October 1 but perhaps soft. They
can be from 6 to 12 months, and just about everyone at CSLI seems to
be eligible, from what I can tell. Since we there will be cuts in
research funds of 25% and 50% over the next two years, this might be
something you would want to explore. For more information, call the
Foundation at (202) 687-4470. I will post the memo I got on the board
in Ventura.
-------
∂19-Sep-84 0926 BARWISE@SU-CSLI.ARPA Tea today
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 19 Sep 84 09:26:54 PDT
Date: Wed 19 Sep 84 09:23:15-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Tea today
To: Research@SU-CSLI.ARPA
Reminder that we will discuss the role of psychology at CSLI at tea
today.
Jon
-------
∂19-Sep-84 0941 @SU-CSLI.ARPA:TW@SU-AI.ARPA Emergency
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 19 Sep 84 09:40:33 PDT
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Wed 19 Sep 84 09:35:53-PDT
Date: 19 Sep 84 0936 PDT
From: Terry Winograd <TW@SU-AI.ARPA>
Subject: Emergency
To: principals@SU-CSLI.ARPA
∂18-Sep-84 1528 REGES@SU-SCORE.ARPA Emergency
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 18 Sep 84 15:28:43 PDT
Date: Tue 18 Sep 84 15:23:51-PDT
From: Stuart Reges <REGES@SU-SCORE.ARPA>
Subject: Emergency
To: faculty@SU-SCORE.ARPA
Office: Margaret Jacks 210, 497-9798
I have had a very difficult time finding an instructor for the Programming
Languages course, CS142/EE285. I found someone who was going to do it, but she
cancelled out yesterday. If any of you have a lead for an advanced student or
industrial lecturer who might teach the course, please let me know immediately.
The class is supposed to meet TTh 9:30-10:45, but we could probably change that
if necessary (better to have a class at a different time than no class).
I'm really at a loss to know how to staff this class. If any of you can help
me out, I'd greatly appreciate it.
-------
∂19-Sep-84 0953 RA
Bob Lackher from Denelcor called. His # (206) 775 1322.
∂19-Sep-84 1139 RA Your trip to Marseille
Dominique Delapparent from the University of Marseille called regarding
your tickets. Wants to know whether you made your travel arrangemnts
yet. If you did, he needs your invoice so that he can send you the money. If
not, he needs your schedule so he can buy you the ticket and mail it to you. He
will call back Tuesday morning. His number in France is 33 42 25 33 77. He works
with Prof. Colmerauer.
∂19-Sep-84 1247 kateveni@su-shasta.arpa Advice on Colloquium speakers ?
Received: from SU-SHASTA.ARPA by SU-AI.ARPA with TCP; 19 Sep 84 12:47:51 PDT
Date: Wednesday, 19 Sep 1984 12:45-PDT
To: buchanan at Sumex <buchanan@Sumex>,
feigenbaum at Sumex <feigenbaum@Sumex>,
genesereth at Sumex <genesereth@Sumex>, jmc at Sail <jmc@Sail>
Cc: kateveni at Shasta <kateveni@Shasta>
Subject: Advice on Colloquium speakers ?
From: Manolis Katevenis <kateveni@Shasta>
As you probably have heard, I am in charge of the CS Colloquium this
quarter. I wanted to ask your advice on suggested speakers:
(1) If you have any speakers to suggest, either in the AI area or
anywhere else, please tell me so, either now or later on in the quarter.
(2) There are several potential invitees, that have already been
suggested to me by various people, and there are not that many slots
left open -- in addition, these do not yet include suggestions by
AI-people. Would you recognize some speaker(s) among the following,
that you think is(are) very good, and that you would like to see speak
at the Cooloquium ?
Ira Goldstein(HP Labs)
Peter Deutsch(PARC)
Nimrod Megiddo(IBM)
Jim Horning
Bruce Lindsey(IBM)
Randy Katz (UCB)
Ed Lazowska(UW-DEC.SRC)
Ken Sevcik(Toronto-DEC.SRC)
Bob Taylor(DEC-SRC)
Paul Rosenbloom (SU)
Stan Rosenschein(SRI)
Moshe Vardi (CSLI)
Joe Halpern, Yoram Moses (**** see below ****)
Jim Gosling(CMU,SUN)
Bill Joy (SUN)
Clarence Ellis (PARC,SU)
Les Goldschlager
Date: 16 Sep 84 1517 PDT
From: Yoram Moses <YOM@SU-AI.ARPA>
Subject: CS Colloquium
To: kateveni@SU-SHASTA.ARPA
Hi,
I'm a grad student at the CS dept. at Stanford. A recent paper that I wrote
with Joe Halpern of IBM San Jose on knowledge in distributed systems, and
that was presented at the PODC conference in vancouver this summer has
sturred quite a bit of interest amongst people in AI, distributed systems,
algorithms etc. It therefore seems an appropriate subject for a colloquium talk.
Do you have unscheduled dates for colloquiums at the beginning of fall quarter?
Yoram Moses (yom@sail)
---------------------
Thanks a lot,
Manolis.
∂19-Sep-84 1636 DFH
Joe Karnegi from Variance called. They have an opening for AI person, a
graduate student perhaps. Will call back. His # 424 5085
∂19-Sep-84 1647 DFH
Norbert Cot came by to see you, he is going back to France on Sat.
Was asked by the French Ministry of Education to write a report about
teaching AI. Wondered if you have any material on the subject. I have his
address in case you have something to send him.
∂20-Sep-84 0843 talmy%ucbkim@Berkeley your upcoming talk here
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 20 Sep 84 08:43:20 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.31)
id AA24637; Thu, 20 Sep 84 08:44:54 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA09329; Wed, 19 Sep 84 21:49:40 pdt
Date: Wed, 19 Sep 84 21:49:40 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8409200449.AA09329@ucbkim.ARPA>
To: jmc@su-ai.ARPA
Subject: your upcoming talk here
Cc: talmy%ucbkim@Berkeley
John--
This is just a reminder--though I'm sure you don't need one--that you're
scheduled to visit us again this coming Tuesday. That is, Sept. 25, 11 am
to 2, 240 Bechtel, and same parking arrangement.
Could you tell me again what kind of equipment you need? I have a faint
memory of it being a non-standard slide projector. Do let me know in
advance in case I have to make special arrangements to procure one.
Thanks. See you soon. --Len
∂20-Sep-84 1008 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley panel discussion
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 20 Sep 84 10:08:38 PDT
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA26211; Thu, 20 Sep 84 10:09:55 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA04618; Thu, 20 Sep 84 09:45:31 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA02792; Thu, 20 Sep 84 09:44:12 pdt
Date: Thu, 20 Sep 84 09:44:12 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8409201644.AA02792@ucscg.UCSC>
To: jmc@su-ai
Subject: panel discussion
Cc: ornstein.pa@xerox
You were out of town, so we had to assume that
you were willing to go ahead with the panel discussion
even though Stefik will not participate. Don't worry,
Ornstein and Winograd won't gang up on you. In my
previous message I asked if you wanted to suggest
another participant--you still could do that, although
it won't be possible to put their name on the publicity.
The posters say the event is sponsored by San Jose State
University and CPSR--it's an official university event,
but CPSR is handling the publicity. The posters do
not imply that you have any connection with CPSR.
The discussion will take place at 5:30 p.m. on Oct. 1
in Duncan Hall 135. Take 280 south past downtown
San Jose and get off at 7th Ave. Take two left turns
so that you pass under the freeway and are going north
on Seventh Street. After a few blocks Seventh Street
dead-ends at San Carlos. When you can already see the
dead end ahead, there is a parking garage on your left.
Enter through the employee entrance and park there.
(I will mail you a temporary parking permit,
or else later send further info about parking, but the
chances are excellent that you could park there with
impunity at that hour anyway.) Duncan Hall is to be found
beyond the garage to the west. (You entered on the east).
I would be happy to treat you and the other two speakers
to dinner at a nearby restaurant after the discussion; you
need not decide about that in advance.
The format of the discussion will be: each participant
will make a ten-minute presentation. Then there will be
a period of discussion between the panelists (say half an
hour to forty-five minutes). Then there will be a period
of questions from the floor.
∂20-Sep-84 1027 LISKOV@MIT-XX.ARPA Re: your thesis
Received: from MIT-XX.ARPA by SU-AI.ARPA with TCP; 20 Sep 84 10:27:19 PDT
Date: Thu 20 Sep 84 13:24:51-EDT
From: Barbara H. Liskov <LISKOV@MIT-XX.ARPA>
Subject: Re: your thesis
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Sun 16 Sep 84 19:04:00-EDT
It's fine with me if you want to publish the thesis. I have not looked
at it since I completed it, and have no interest in doing so.
I hope it is ok technically?
Barbara
-------
∂20-Sep-84 1211 ullman@diablo Bell
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 20 Sep 84 12:10:57 PDT
Date: Thu, 20 Sep 84 12:11:42 pdt
From: Jeff Ullman <ullman@diablo>
Subject: Bell
To: gardner@sumex, jmc@sail, tw@sail, wiederhold@sumex
I finally heard from Aho, and he says we should send in all four
proposals, including the McCarthy/Gardner proposal.
Since John is away, I'm going to have to ask Anne to follow
through on that and prepare this proposal as well as working
with Terry. I'm going to express mail things on Monday 24th.
The deadline is real, as the committee to decide on
awards meets on the 28th.
∂20-Sep-84 1540 RA
Terry Flanery from Microdato,(714) 250 1000 ext 7169, wanted to know whether
you'll be willing to speak for UCI in April.
∂21-Sep-84 0112 oliger@Navajo protoproposal
Received: from SU-NAVAJO.ARPA by SU-AI.ARPA with TCP; 21 Sep 84 01:11:45 PDT
From: Joseph Oliger <oliger@Navajo>
Date: 21 Sep 1984 0110-PDT (Friday)
To: JMC@SU-AI.ARPA
Cc: oliger@Navajo
Subject: protoproposal
Here is my page. -jo-
-------------------------------------------------------------------
Parallelism in Scientific Computation
Joseph Oliger
It is quite clear that parallelism should be useable and profitable for
simulations of natural phenomena since such phenomena are the result of
interactions of simultaneous events. Parallel processing is a natural
phenomenon! However, the amount of parallelism that can be effectively used
in simulations and how it can be attained is not well understood. These are
the issues that we intend to focus upon in this study.
We are primarily interested in evolutionary problems such as numerical weather
prediction, oceanographical calculations of currents and fronts, aerodynamical
calculations of vortex shedding and flutter, and of wave propagation in
seimology and underwater accoustics.
Issues of asymptotically attainable parallelism and of asymptotically scalable
architectures can be studied theoretically. But the import of such results
upon specific requirements for given computational requirements can only be
obtained experimentally. We intend to investigate the amount of parallelism
that can be profitably used to attain specified accuracy for problems from
those areas mentioned above. This involves the issue of granularity -- is it
more effective to use fewer more powerful processors or more less powerful
processors? We would also investigate the minimal topolgical connectivity
required to sustain calculations for the applications mentioned above without
loss of efficiency. It is the needed interprocessor connections that limit
the machines that can be constructed.
We also propose to investigate higher level language constructs for scientific
computation and their implementation. Nature executes in parallel but we are
not accustomed to discribe this dance in parallel. Very few significant
algorithmic advances utilize parallelism in a meaningful way. Significant
notational advances are required to facilitate the thought processes needed
for such algorithms. Such experience can only be gained experimentally.
We feel that the HEP can be very effective for these studies because it exists
in a stable and usable environment so that we are not required to do extensive
system development to accomplish our objectives. It also has shared memory so
distributed memory configurations can easily be simulated in a realistic way.
Parallelism in Scientific Computation
Joseph Oliger
It is quite clear that parallelism should be useable and profitable for
simulations of natural phenomena since such phenomena are the result of
interactions of simultaneous events. Parallel processing is a natural
phenomenon! However, the amount of parallelism that can be effectively used
in simulations and how it can be attained is not well understood. These are
the issues that we intend to focus upon in this study.
We are primarily interested in evolutionary problems such as numerical weather
prediction, oceanographical calculations of currents and fronts, aerodynamical
calculations of vortex shedding and flutter, and of wave propagation in
seimology and underwater accoustics.
Issues of asymptotically attainable parallelism and of asymptotically scalable
architectures can be studied theoretically. But the import of such results
upon specific requirements for given computational requirements can only be
obtained experimentally. We intend to investigate the amount of parallelism
that can be profitably used to attain specified accuracy for problems from
those areas mentioned above. This involves the issue of granularity -- is it
more effective to use fewer more powerful processors or more less powerful
processors? We would also investigate the minimal topolgical connectivity
required to sustain calculations for the applications mentioned above without
loss of efficiency. It is the needed interprocessor connections that limit
the machines that can be constructed.
We also propose to investigate higher level language constructs for scientific
computation and their implementation. Nature executes in parallel but we are
not accustomed to discribe this dance in parallel. Very few significant
algorithmic advances utilize parallelism in a meaningful way. Significant
notational advances are required to facilitate the thought processes needed
for such algorithms. Such experience can only be gained experimentally.
We feel that the HEP can be very effective for these studies because it exists
in a stable and usable environment so that we are not required to do extensive
system development to accomplish our objectives. It also has shared memory so
distributed memory configurations can easily be simulated in a realistic way.
∂21-Sep-84 1405 VAL
technical report
∂21-Sep-84 1407 VAL
Kathy Berg tells me that she needs to know which of your accounts will be
covering the publications costs for my technical report. Please give her that
information. Thanks,
Vladimir
∂22-Sep-84 1242 ARK Office Assignment Information
To: JMC
CC: ARK
No, this is not a request to change things. Rather it is a request for
information. Could you tell me who will be in 360, 362, and 302 during
the fall? I'd like to update the databases so people will be listed in
their correct offices on the Podium downstairs and on the maps near the
elevator. Thanks.
Arthur
∂22-Sep-84 1713 ARK@SU-SCORE.ARPA Office
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 22 Sep 84 17:11:31 PDT
Date: Sat 22 Sep 84 17:08:38-PDT
From: Arthur Keller <ARK@SU-SCORE.ARPA>
Subject: Office
To: Casley@SU-SCORE.ARPA
cc: JMC@SU-AI.ARPA
John McCarthy has agreed to house you in his space. You should ask him
where, and move on or before Monday. Thanks.
Arthur
-------
∂22-Sep-84 2313 ullman@diablo resumes
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 22 Sep 84 23:13:47 PDT
Date: Sat, 22 Sep 84 23:14:49 pdt
From: Jeff Ullman <ullman@diablo>
Subject: resumes
To: gardner@sumex, jmc@sail, tw@sail, wiederhold@sumex
While the Bell request does not call for resumes,
I wonder if we should not include them to try to convince
the committee that Stanford people are great, relative to
other dippy places where they might make awards.
∂23-Sep-84 1002 NILSSON@SRI-AI.ARPA Re: CBCL lives?
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 23 Sep 84 10:02:42 PDT
Date: Sun 23 Sep 84 10:03:25-PDT
From: NILSSON@SRI-AI.ARPA
Subject: Re: CBCL lives?
To: JMC@SU-AI.ARPA
cc: rosenschein@SRI-AI.ARPA, NILSSON@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 14 Sep 84 16:15:00-PDT
John, I've been out of town (and I think Stan has too), so I've just
now read your msg about CBCL. Stan and I will discuss the matter and
then respond. -Nils
-------
∂24-Sep-84 0900 JMC*
Stan or Nils re Anne Gardner and CBCL
∂24-Sep-84 0950 Brachman@SRI-KL.ARPA Dayton Ohio Applications Conference?
Received: from SRI-KL.ARPA by SU-AI.ARPA with TCP; 24 Sep 84 09:50:27 PDT
Date: Mon 24 Sep 84 09:10:24-PDT
From: Ron Brachman <Brachman at SRI-KL at SU-DSN>
Subject: Dayton Ohio Applications Conference?
To: Bledsoe at UTEXAS-20 at SU-DSN
cc: Tenenbaum at SRI-KL at SU-DSN, Genesereth at SUMEX-AIM,
JMC at SU-AI
Woody,
I just received the copy of your exchange with Steve Cross over their
proposed Applications Conference. I want to very strongly suggest that
we withhold any action on this until we constitute our full Conference
Committee (i.e., with the next Program Chairman). Since the whole issue
of a separate applications conference has been discussed extensively,
and has not been resolved yet, I think we should stay away from having
one just because we have a volunteer. In particular, along with AAAI
tradition, if this is going to be a AAAI-sponsored conference, I think
WE should choose the Program Chairman, and determine where the
conference should be held. If we just let these people go ahead without
any supervision from us (and this certainly seems to go well beyond a
workshop), I think we will let something very important get out of our
control.
Ron
-------
∂24-Sep-84 1032 RA your Berkeley talk 9/25
Len talmy wanted to remind you about the talk and ask you whether you need
a projector or anything else for your talk. His ≠ (57) 644 1064.
∂24-Sep-84 1055 ZM
Dave Fink from Denelcor called. He'll call again tomorrow.
∂24-Sep-84 1124 GENESERETH@SUMEX-AIM.ARPA Re: Dayton Ohio Applications Conference?
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 24 Sep 84 11:23:45 PDT
Date: Mon 24 Sep 84 11:23:58-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
Subject: Re: Dayton Ohio Applications Conference?
To: Brachman@SRI-KL.ARPA
cc: Bledsoe@UTEXAS-20.ARPA, Tenenbaum@SRI-KL.ARPA, JMC@SU-AI.ARPA
In-Reply-To: Message from "Ron Brachman <Brachman at SRI-KL>" of Mon 24 Sep 84 09:50:48-PDT
Woody,
I strongly agree with Ron's view on the applications conference.
mrg
-------
∂24-Sep-84 1313 ZM
Erik Ostrom (7-2607) called, wanted to talk to you about Joe Dingheim.
∂24-Sep-84 1351 RA
I left an envelop marked CONFIDENTIAL on your desk.
∂24-Sep-84 1541 EJS
To: buchanan@SUMEX-AIM.ARPA, genesereth@SU-SCORE.ARPA,
feigenbaum@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
winograd@SU-SCORE.ARPA
Dear AI Faculty,
I am teaching the CS122 LISP programming course this fall.
After looking through every teaching text on the market, I am
convinced that STRUCTURE AND INTERPRETATION OF COMPUTER PROGRAMS
by Abelson, Sussman and Sussman is the book that should be the
text for this course.
This book is EXTREMELY well writen, and easy to learn from.
We have solutions to all of its exercises up at LOTS.
Scheme is a good dialect of lisp to learn because it has lexical
Scoping and other features which encourage good programming practices.
This book is comprehensive, I would like to use it as the primary text
and use Winston's LISP second edition as a recomended text.
If you all think that teaching SCHEME is a bad idea I will use
Winston's more clumsy LISP book and use the Abelson book as a
recomended second source.
Ted
∂24-Sep-84 1543 Bobrow.pa@Xerox.ARPA Re: ---
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 24 Sep 84 15:42:26 PDT
Received: from Semillon.ms by ArpaGateway.ms ; 24 SEP 84 15:43:03 PDT
Date: 24 Sep 84 15:42 PDT
From: Bobrow.pa@XEROX.ARPA
Subject: Re: ---
In-reply-to: John McCarthy <JMC@SU-AI.ARPA>'s message of 16 Sep 84 19:25
PDT
To: JMC@SU-AI.ARPA
cc: bobrow.PA@XEROX.ARPA
John,
I think the pages will be worth it. North Holland is giving us them for
free, and we are not that backlogged on papers. If you want to rewrite
your response, I will hold these until the end of October. Do you want
to be reminded again, or will you remember? You need not answer any
questions you think dull. Dennett chose only one question for which he
wrote one full page response.
Thanks for contributing.
danny
∂24-Sep-84 1735 GOGUEN@SRI-AI.ARPA course description
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 24 Sep 84 17:34:51 PDT
Date: Mon 24 Sep 84 17:35:03-PDT
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: course description
To: jmc@SU-AI.ARPA
cc: goguen@SRI-AI.ARPA, meseguer@SRI-AI.ARPA
John,
Here is the course description you wanted, four months early (or eight
months late, depending on the point of view). Pepe Meseguer and I would like
to teach this together. Is it possible to fit such a wish into the framework
of these courses?
Cheers,
Joseph
-------
∂25-Sep-84 0019 GOGUEN@SRI-AI.ARPA Re: course description
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 00:19:17 PDT
Date: Tue 25 Sep 84 00:19:39-PDT
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: Re: course description
To: JMC@SU-AI.ARPA
cc: GOGUEN@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 25 Sep 84 00:11:00-PDT
John, thanks for the note; we'll be glad to divide the money. Now let
me try again for the description:
SEMANTICS OF COMPUTATION
J. A. Goguen and J. Meseguer
This course will attempt to develop a unified algebraic foundation for computer
science, emphasizing semantics. The following topics may be covered, depending
on class interest: introduction to universal algebra; abstract syntax and word
algebras; attribute semantics and initial algebras; fully abstract semantics;
abstract data types; compiler correctness proofs; rewrite rules; equational
programming; semantics of programming languages; denotational semantics; the
subsort approach to errors, exceptions, multiple inheritance and partial
functions; specification of generic programs; parameterized programming;
computability theory; object-oriented programming; abstract model theory and
logic programming. A number of open research problems will also be discussed.
-------
∂25-Sep-84 0631 ERIC@SU-CSLI.ARPA Re: Zingheim
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 06:31:17 PDT
Date: Tue 25 Sep 84 06:30:52-PDT
From: Eric Ostrom <ERIC@SU-CSLI.ARPA>
Subject: Re: Zingheim
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 25 Sep 84 00:08:00-PDT
OK, thanks...
-------
∂25-Sep-84 0818 talmy%ucbkim@Berkeley reassurance requested
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 08:18:25 PDT
Received: from ucbkim.ARPA by UCB-VAX.ARPA (4.24/4.31)
id AA11024; Tue, 25 Sep 84 08:20:02 pdt
Received: by ucbkim.ARPA (4.24/4.27)
id AA07089; Tue, 25 Sep 84 01:32:02 pdt
Date: Tue, 25 Sep 84 01:32:02 pdt
From: talmy%ucbkim@Berkeley (Len Talmy)
Message-Id: <8409250832.AA07089@ucbkim.ARPA>
To: jmc@su-ai
Subject: reassurance requested
Cc: talmy%ucbkim@Berkeley
John-- I haven't heard from you and your secretary was unable to reach you.
I'm kind of hoping you'll remember to come here tomorrow (i.e., today, Tuesday)
at 11 am for your talk. I'll have a 35 mm slide projector ready. If you
should read this early Tuesday, you might send me a message reassuring me of
your imminent arrival. --Len
∂25-Sep-84 0934 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa contract
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 09:31:42 PDT
Received: from ibm-sj by csnet-relay.csnet id aa12585; 25 Sep 84 12:16 EDT
Date: Tue, 25 Sep 84 11:23:20 EDT
From: mike blasgen <BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa>
To: jmc%su-ai.arpa@csnet-relay.arpa
Subject: contract
did you get earlier messages? or is csnet broke?
∂25-Sep-84 0934 BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa contract
Received: from CSNET-RELAY.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 09:31:53 PDT
Received: from ibm-sj by csnet-relay.csnet id ab12585; 25 Sep 84 12:17 EDT
Date: Tue, 25 Sep 84 11:21:11 EDT
From: mike blasgen <BLASGEN.YKTVMT%ibm-sj.csnet@csnet-relay.arpa>
To: jmc%su-ai.arpa@csnet-relay.arpa
Subject: contract
did you get my previous message?
mike
∂25-Sep-84 1047 GENESERETH@SUMEX-AIM.ARPA
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 10:45:57 PDT
Date: Tue 25 Sep 84 10:32:37-PDT
From: Michael Genesereth <GENESERETH@SUMEX-AIM.ARPA>
To: EJS@SU-AI.ARPA
cc: buchanan@SUMEX-AIM.ARPA, feigenbaum@SUMEX-AIM.ARPA, JMC@SU-AI.ARPA,
winograd@SU-SCORE.ARPA, genesereth@SUMEX-AIM.ARPA
In-Reply-To: Message from "Ted Selker <EJS@SU-AI.ARPA>" of Mon 24 Sep 84 15:41:00-PDT
Gentlemen,
In light of the purpose of 122 I am mildly opposed to the use of Abelson
and Sussman in 122. It's not that I thik there is a better book. Most
of the current texts stink. IT's just that I think that A&S teaches the
wrong things for this course.
122 is the descendant of 102. We introduced 102 initially as an introduction
to lisp PROGRAMMING, as opposed to the theory of lisp (206) and the practice
of computer programming (105/6/7). We needed a course in which one could
acquire the skills of programming in lisp, including debugging techniques,
use of the compilers, teamwork on large systems, etc. It is my opinion that
the focus of the A&S book on scheme rather than more commonly available lisps
(with dynamic scoping and powerful debugging aids) undercuts the basic purpose
of the course and therefore is inappropriate.
Having said that let me remark that I think A&S is an excellent text and that
it should be used in 105/6/7. IT is exactly the right thing for that
course. If we were to use it for 122, someone else would have to invent a
new course to teach the details of the lisps we actually use, and that's
what 122 is supposed to be.
On the other hand, I am not teaching 122 this fall and have no desire to
do so. I also believe the instructor should hgave discretion in these
matters, so long as it is compativble with our intentions for the
curriculum. Selker proposed an alternative that I found attractive,
viz. to use Winston (ugh) as the primary text (or maybe he could use
Steele's common lisp manual) and use A&S as recommended background
reading on advnaced lisp issues.
mrg
-------
∂25-Sep-84 1215 TU@SU-SCORE.ARPA grade for cs206 from last year
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 12:14:51 PDT
Date: Tue 25 Sep 84 12:11:52-PDT
From: Samson Tu <TU@SU-SCORE.ARPA>
Subject: grade for cs206 from last year
To: jmc@SU-AI.ARPA
cc: tu@SU-SCORE.ARPA
Prof. McCarthy, I checked my transcript a few days ago and found that
I still have an incomplete for cs206 which I took last year. Can you
look into that? Yorm said that you were giving me a grade at the
beginning of summer. Thanks.
Samson
encl.
20-Jun-84 00:10:36-PDT,470;000000000001
Return-Path: <YOM@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-SCORE.ARPA with TCP; Wed 20 Jun 84 00:10:26-PDT
Date: 20 Jun 84 0010 PDT
From: Yoram Moses <YOM@SU-AI.ARPA>
Subject: Your grade
To: Tu@SU-SCORE.ARPA
CC: JMC@SU-AI.ARPA
Prof. McCarthy is taking care of giving you a final grade for the course.
He will probably notify you when he does. Otherwise, (if you don't hear from
him in a week), send him a message (to jmc@sail).
Yoram.
-------
∂25-Sep-84 1400 JMC*
Heller 7-3501
∂25-Sep-84 1400 JMC*
Blasgen
∂25-Sep-84 1400 JMC*
∂19-Sep-84 0953 RA
Bob Lackher from Denelcor called. His # (206) 775 1322.
∂25-Sep-84 1400 JMC*
∂21-Sep-84 1407 VAL
Kathy Berg tells me that she needs to know which of your accounts will be
covering the publications costs for my technical report. Please give her that
information. Thanks,
Vladimir
∂25-Sep-84 1522 RA
Gordon Bell (412)361 8600 called wants to talk to you about DARPA proposal.
∂25-Sep-84 1601 ORTIZ@SRI-AI.ARPA Non-monotonic paper
Received: from SRI-AI.ARPA by SU-AI.ARPA with TCP; 25 Sep 84 16:00:56 PDT
Date: Tue 25 Sep 84 16:01:18-PDT
From: ORTIZ@SRI-AI.ARPA
Subject: Non-monotonic paper
To: jmc@SU-AI.ARPA
cc: ortiz@SRI-AI.ARPA
Dear Professor McCarthy,
I enjoyed your talk at Berkeley today. I would be very interested
in receiving a copy of the paper you are presenting at the Conference on
Non-Monotonic Reasoning next month. My mailing address is:
Charles Ortiz
Room EJ-327
RI International
333 Ravenswood Ave
Menlo Park, CA 94025
Thank you very much.
Charles Ortiz
-------
∂25-Sep-84 1610 RTC CS206 Information sheet.
Subject: CS206 Information sheet.
I want to have an information sheet printed for the
first class.
- Is there a computer version I can modify?
- Do you want your office hours listed on it, and, if so, what times?
- How do I contact John Luigi to ask the same questions?
- What should I put about the assessment policy?
Ross.
∂26-Sep-84 0206 GROSOF@SU-SCORE.ARPA I'm back from vacation
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 02:06:09 PDT
Date: Wed 26 Sep 84 02:02:32-PDT
From: Benjamin N. Grosof <GROSOF@SU-SCORE.ARPA>
Subject: I'm back from vacation
To: mullen@SUMEX-AIM.ARPA, genesereth@SUMEX-AIM.ARPA
cc: jmc@SU-AI.ARPA
-------
∂26-Sep-84 0901 TU@SU-SCORE.ARPA Re: grade
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 09:01:44 PDT
Date: Wed 26 Sep 84 08:58:56-PDT
From: Samson Tu <TU@SU-SCORE.ARPA>
Subject: Re: grade
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Tue 25 Sep 84 18:08:00-PDT
May I ask how the "B+" was derived? Thanks. Samson
-------
∂26-Sep-84 0950 RA
John Alden from Texas Instruments will be on campus next Tuesday and
Wednesday (October 2nd and 3rd). He would like to meet with you and
discuss AI and TI products for AI. Let me know if you want to meet him
and if so, when.
∂26-Sep-84 1059 BETSY@SU-CSLI.ARPA 2nd offices
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 10:59:20 PDT
Date: Wed 26 Sep 84 10:56:21-PDT
From: Betsy Macken <BETSY@SU-CSLI.ARPA>
Subject: 2nd offices
To: researchers@SU-CSLI.ARPA
cc: jamie@SU-CSLI.ARPA
A number of people with more than one office have let us know that
they aren't using their offices in the CSLI trailers as much as we
anticipated they might. They suggested that we set aside a few large
office for those whose offices here are second offices. These offices
would be reserved for any researchers to use as needed, but would not
be assigned to any individual or group, and could be substituted for
some of the designated offices we how have.
Please let Jamie (Jamie@CSLI) know this week if you plan to use your
second office here a lot and want to stay where you're located now, or
if for some other reason you don't like the idea. All of your
comments are welcome. If we don't hear from you by the middle of next
week, we'll assume you don't mind the change.
Betsy
-------
∂26-Sep-84 1212 RA mail to Gordon Bell
I sent three papers to Gordon Bell on Sept. 12:
q lamda paper
hep.dvi
newmac.dvi
Are these the papers you inquired about? If yes, I am surprised he hasn't gotten
them yet.
∂26-Sep-84 1450 @SU-CSLI.ARPA:Kay.pa@Xerox.ARPA Re: 2nd offices
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 14:50:03 PDT
Received: from Xerox.ARPA by SU-CSLI.ARPA with TCP; Wed 26 Sep 84 14:47:43-PDT
Received: from Semillon.ms by ArpaGateway.ms ; 26 SEP 84 13:11:28 PDT
Date: 26 Sep 84 13:10 PDT
From: Kay.pa@XEROX.ARPA
Subject: Re: 2nd offices
In-reply-to: Betsy Macken <BETSY@SU-CSLI.ARPA>'s message of Wed, 26 Sep
84 10:56:21 PDT
To: BETSY@SU-CSLI.ARPA
cc: researchers@SU-CSLI.ARPA, jamie@SU-CSLI.ARPA
I should like to keep things as they are if possible. Lauri and I both
plan to spend quite a bit of time in our office---probably as much as
four full dayts of use per week between the two of us.
--Martin.
∂26-Sep-84 1504 RA
Kasey Boyd in applying for graduate school at Stanford. He is going to be
in town next Thursday and Friday (4-5/10).
He would like to set an appointment with you and
would also like to know whether it's ok for him to sit in on your Thursday class.
Please let me know.
∂26-Sep-84 1603 TU@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 16:03:34 PDT
Date: Wed 26 Sep 84 15:51:50-PDT
From: Samson Tu <TU@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 26 Sep 84 15:20:00-PDT
I do think I deserve an A-. I missed two assignments but did well in the
rest of the course work. Samson
-------
∂26-Sep-84 1809 ASHOK@SU-SCORE.ARPA The project
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 18:09:28 PDT
Date: Wed 26 Sep 84 17:54:51-PDT
From: Ashok Subramanian <ashok@SU-SCORE.ARPA>
Subject: The project
To: jmc@SU-AI.ARPA
cc: ashok@SU-SCORE.ARPA
Frankly, I've not been giving it as much attention as I should, but
I've decided to do it. A first look suggests that it might be pretty
straightforward to hack up, but doing it cleanly might take a while
longer. A good chance to brush up my rusty Lisp-hacking skills.
I think you mentioned Common-Lisp at our last meeting. Do you want me
to do the project in CommonLisp ? (Yes/no/don't care) I'm not sure how
many machines support CommonLisp at this point in time. Friends have
been suggesting I should take this opportunity to play with either the
Lisp Machine, or with Interlisp-D on the dandelions that are floating
around. (if I can gain access to them, that is)
I'd like to talk with you about issues in AI : which ones you consider
important and why, which goals unreachable (for now, at least), and
which trivial. It might help if we restrict the sub-areas of AI to the
following: Issues in representation, learning, planning and problem
solving, reformulation, control of inference, and maybe commonsense
reasoning. Also the entire question of validation of AI research,
i.e., when can we state that a piece of work (or thesis) has achieved
something non-trivial, especially in the context of the nature and
quality of AI theses today.
Should I just walk in when you seem free, or are some times better for
you ? (I've just been working on my schedule for fall quarter - MWF are my
freer days, and TTh are really full.)
ashok
-------
∂26-Sep-84 1936 Allen.PA@Xerox.ARPA Input Scanning Contact
Received: from XEROX.ARPA by SU-AI.ARPA with TCP; 26 Sep 84 19:36:27 PDT
Received: from Salvador.ms by ArpaGateway.ms ; 26 SEP 84 16:41:22 PDT
Date: 26 Sep 84 16:23:42 PDT (Wednesday)
From: Allen.PA@XEROX.ARPA
Subject: Input Scanning Contact
To: JMC@SU-AI.ARPA
cc: Spencer.PA@XEROX.ARPA, Allen.PA@XEROX.ARPA
Bill Spencer asked me to give you the following information of someone
he feels is a good contact regarding input scanning.
The fellow is Dr. Carl Hamacher, Director, Computer Systems Research
Institute, University of Toronto, Sandford Fleming Building, 10 King's
College Road, Toronto, Canada M5S 1A4, phone 416-978-8726.
Please let me know if I can furnish any more information.
Dorene
∂27-Sep-84 0554 ATP.BLEDSOE@UTEXAS-20.ARPA Re: Stephen Cross request for conference support
Received: from UTEXAS-20.ARPA by SU-AI.ARPA with TCP; 27 Sep 84 05:54:06 PDT
Date: Thu 27 Sep 84 07:54:58-CDT
From: Woody Bledsoe <ATP.Bledsoe@UTEXAS-20.ARPA>
Subject: Re: Stephen Cross request for conference support
To: JMC@SU-AI.ARPA, bledsoe@UTEXAS-20.ARPA, aaai@SUMEX-AIM.ARPA
cc: ATP.Bledsoe@UTEXAS-20.ARPA, Braughman@SRI-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 26 Sep 84 15:57:00-CDT
I agree John that the Cross afair is not a workshop (I didn't give it
enough thought). Now we must handle this request as part of a larger
question.
-------
∂27-Sep-84 0852 AAAI-OFFICE@SUMEX-AIM.ARPA Cross's proposal
Received: from SUMEX-AIM.ARPA by SU-AI.ARPA with TCP; 27 Sep 84 08:51:57 PDT
Date: Thu 27 Sep 84 08:51:39-PDT
From: AAAI <AAAI-OFFICE@SUMEX-AIM.ARPA>
Subject: Cross's proposal
To: Bledsoe@UTEXAS-20.ARPA, JMC@SU-AI.ARPA
cc: aaai-office@SUMEX-AIM.ARPA
Telephone: (415) 328-3123
Postal-Address: 445 Burgess Drive, Menlo Park, CA 94025
Woody and John,
I agree with your comments about further consideration and thought
for this proposal, especially in light of the discussion about
splitting the NCAI into two conferences.
Let me give you some history about the IEEE-PAMI Applied AI
COnference. Last fall, Marty told Ron and I that the IEEE
was planning to have this conference at the same time
and location as our NCAI. Marty, Ron and I encouraged
Jake Aggarwal to move the conference to some other time,
which he did. We also discussed how we could help facilitate
their conference; we decided to sell them our mailling list
and allow them to advertise free in the magazine so that
our members could get a discount registration fee to their
conference. That is the limit to our involvement in this
conference (which frankly isn't much). I think we should
see how the IEEE experiment pans out before we proceed
with any decision to divide our conference.
What do you think?
---Claudia
-------
∂27-Sep-84 0900 JMC*
borofsky
∂27-Sep-84 0900 JMC*
Claudia and Woody
∂27-Sep-84 1101 JMC*
toronto and mike
∂27-Sep-84 1110 SMC title macro
I will make you that macro probably tonight. I have found that I needed, and
need still, to read alot more in the TeX manual in order to do the other macro
designs. That is why I didn't come in yesterday. I stayed home and read the
manual.
∂27-Sep-84 1150 RA
Tom Kurtz from Dartmouth College would like you to call him
at home (603) 448 1708 between 4:00-7:00pm today (our time).
∂27-Sep-84 1432 RA
Bob Lacher called.
∂27-Sep-84 1445 CLT opera
starts at 8pm
so we should leave not later than 7pm
i will be at the house unless i let you know otherwise
∂27-Sep-84 1654 BARWISE@SU-CSLI.ARPA [Weide Guo <KUO@SU-AI.ARPA>: Application for Traveling Assistance ]
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Sep 84 16:54:07 PDT
Date: Thu 27 Sep 84 16:54:36-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: [Weide Guo <KUO@SU-AI.ARPA>: Application for Traveling Assistance ]
To: John@SU-CSLI.ARPA, JMC@SU-AI.ARPA
cc: betsy@SU-CSLI.ARPA, wasow@SU-CSLI.ARPA
Either of you interested in giving him some travel support from you
initiators fund?
---------------
Return-Path: <KUO@SU-AI.ARPA>
Received: from SU-AI.ARPA by SU-CSLI.ARPA with TCP; Thu 27 Sep 84 16:51:03-PDT
Date: 27 Sep 84 1618 PDT
From: Weide Guo <KUO@SU-AI.ARPA>
Subject: Application for Traveling Assistance
To: BARWISE@SU-CSLI.ARPA
CC: KUO@SU-AI.ARPA
Dear Prof.Barwise:
I am willing to attend the "Logic and Artificial Intelligence" Conference
which will be held at the University of Maryland on October 22-26, however,
I am afraid I cannot afford the travel and accommodation expense, therefore,
I wrote to Dr.Jack Minker and Dr.Donald Perlis to apply for the financial
assistance. I got their answer immediately, which said they could support
me up to $250 for one week's staying there but they could not offer traveling
assistance. I am wondering if it's possible to get traveling assistance from
CSLI. Would you be kind enough to instruct me for this matter? I would
appreciate your help very much.
--Victor Kuo <KUO@SU-AI>
-------
∂27-Sep-84 1733 RTC CS206 Info sheet errors.
These are the errors I know about in the information sheet
for CS206. I will hand out corrections next Tuesday.
If you know any more errors, please point them out.
---------------------------------------------------
1. Gianluigi's LOTS address is LOTSB not LOTSA
2. I will add his SAIL address as well.
3. ALL of the "Programming and Proving" book will be handed
out in class, and therefore the charge for class notes
will be $7, not $3.50. (This charge only applies to
people who pick up notes in class, not the TV students.)
4. Steele's "Common Lisp" book is required, not optional.
Ross.
PS. If there is an exercise set to be given on Tuesday, we
should get a copy to SITN soon.
∂27-Sep-84 1745 BARWISE@SU-CSLI.ARPA Project and Area Leaders
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 27 Sep 84 17:45:27 PDT
Date: Thu 27 Sep 84 17:44:14-PDT
From: Jon Barwise <BARWISE@SU-CSLI.ARPA>
Subject: Project and Area Leaders
To: Research@SU-CSLI.ARPA
cc: Ingrid@SU-CSLI.ARPA, bach-hong@SU-CSLI.ARPA, joyce@SU-CSLI.ARPA,
jamie@SU-CSLI.ARPA
The final piece fell into place today, so here is the list of project
leaders and area co-ordinators for the year.
Area F: Israel
F1: Perry
F2: Israel
F3: Smith
F4: Moore
Area C: Smith
C1: Goguen
C2: Winograd
C3: Smith
Area NL: Karttunen
NL1: Halvorsen
NL2: Bresnan
NL3: Wasow
NL4: Cohen
Area P: Kiparsky (fall quarter), Pentland (winter), Kaplan (spring)
P1: Pentland
P2: Kiparsky
P3: Kaplan
-------
∂28-Sep-84 0900 JMC*
Hamacher 416-978-8726
∂28-Sep-84 0900 JMC*
Decter
∂28-Sep-84 1015 RA reply to message
[In reply to message rcvd 26-Sep-84 21:14-PT.]
∂28-Sep-84 1112 ASHOK@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 11:11:43 PDT
Date: Fri 28 Sep 84 11:04:31-PDT
From: Ashok Subramanian <ashok@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Wed 26 Sep 84 18:16:00-PDT
Yes, today at 2pm is a good time to meet. Hope to see you then.
ashok
-------
∂28-Sep-84 1148 GOLUB@SU-SCORE.ARPA Re: Visit to Denelcor
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 11:48:06 PDT
Date: Fri 28 Sep 84 11:44:52-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: Re: Visit to Denelcor
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 28 Sep 84 11:40:00-PDT
That's not a good time for me.
GENE
-------
∂28-Sep-84 1157 ullman@diablo HEP
Received: from SU-AIMVAX.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 11:56:50 PDT
Date: Fri, 28 Sep 84 11:57:35 pdt
From: Jeff Ullman <ullman@diablo>
Subject: HEP
To: jmc@sail
I'm bogged down responding to the ARPA RFP with a deadline of
Oct. 12. I'm interested in seeing the HEP, but I
just won't have the time to travel.
Also, note that Oct. 6 (and the evening of the 5th) is Yom Kippur.
∂28-Sep-84 1214 minker@maryland ABSTRACT
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 12:13:45 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA20073; Fri, 28 Sep 84 15:13:08 edt
Date: Fri, 28 Sep 84 15:13:08 edt
From: minker@maryland (Jack Minker)
Message-Id: <8409281913.AA20073@maryland.ARPA>
To: JMC@SU-AI
Subject: ABSTRACT
John,
We MUST have your abstract now, since announcements are being
sent out that include abstracts for all talks. Thanks.
Jack
∂28-Sep-84 1237 minker@maryland Theatre Tickets
Received: from MARYLAND.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 12:37:08 PDT
Received: by maryland.ARPA (4.12/4.7)
id AA20797; Fri, 28 Sep 84 15:35:48 edt
Date: Fri, 28 Sep 84 15:35:48 edt
From: minker@maryland (Jack Minker)
Message-Id: <8409281935.AA20797@maryland.ARPA>
To: Barwise%su-csli.arpa.csnet-relay@csnet-relay.ARPA, JMC@SU-AI,
Reiter.Ubc@csnet-relay.ARPA, decvax\!watmath\!mhvanemden@Berkeley,
henschen@ANL-MCS.ARPA
Subject: Theatre Tickets
Cc: egkle@maryland, perlis@maryland, smith@maryland
During the week that you are here, the University of Maryland
is presenting a play, Arms and the Man. by George Bernard
Shaw. I have attended some plays presented here and they have
been very good. The cost to attend the play is a nominal
$7. Since everyone will be here on Tuesday evening, this might
be a good evening to go to the theatre.
If everyone agrees, I will order a block of tickets for us.
Let me know if you want to go and how many tickets you
might want. Some of you may be bringing someone with you.
I am planning to bring my wife and possibly my daughter,
and Don is planning to bring a friend.
Please let me hear from you as soon as possible so that I
can get good seats together.
Jack
∂28-Sep-84 1247 BOSACK@SU-SCORE.ARPA Re: Visit to Denelcor
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 28 Sep 84 12:47:13 PDT
Date: Fri 28 Sep 84 12:44:10-PDT
From: Len Bosack <BOSACK@SU-SCORE.ARPA>
Subject: Re: Visit to Denelcor
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 28 Sep 84 11:40:00-PDT
I'm interested with a moderate preference for Friday. There is a United
flight early (leaves before 0800) and a return about 2030 from Denver.
Len
-------
∂28-Sep-84 1349 RA your swivel chair
A new part (not the one you found) has to be ordered, it will therefore
take a while before you get your chair back.
∂28-Sep-84 1550 SG Office on campus
To: JMC@SU-AI.ARPA
CC: sg@SU-SCORE.ARPA
When can I have an office?
∂28-Sep-84 1642 100 (from: rtc on TTY67, at TV-63) Common Lisp book
The bookstore has sold out of Steele's book, and
if you want them to order some more you must tell
them to do it.
Ross
∂28-Sep-84 1702 RPG
∂28-Sep-84 1140 JMC Visit to Denelcor
To: "@HEP.DIS[E84,JMC]"@SU-AI.ARPA
They can receive us in Denver on Friday October 5 or, if some of
our commitments require it, on Saturday October 6. Burton Smith
is still travelling. They will include a briefing on the HEP 2.
I think we should keep our numbers small. Who wants to go?
Is next Friday or Saturday ok?
I can go friday, but I must return saturday.
∂28-Sep-84 2000 JMC*
Huberman thesis for Ashok.
∂28-Sep-84 2100 JMC*
Classical Wax
∂29-Sep-84 0829 DIKRAN@SU-CSLI.ARPA
Received: from SU-CSLI.ARPA by SU-AI.ARPA with TCP; 29 Sep 84 08:29:15 PDT
Date: Sat 29 Sep 84 08:29:31-PDT
From: Dikran Karagueuzian <DIKRAN@SU-CSLI.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Fri 28 Sep 84 23:56:00-PDT
I'd be happy to. I am curious to know if you'd already
received a copy of this report and the one you're requesting
now is in addition to that one. (You are on an automatic
mailing list to receive all CSLI reports as they become
available and am wondering if the reports I am sending
are being delivered to you.)
--Dikran
-------
∂29-Sep-84 0900 JMC*
Classical Wax
∂29-Sep-84 1856 LLW@S1-A.ARPA FY'85 Consulting Contracts
Received: from S1-A.ARPA by SU-AI.ARPA with TCP; 29 Sep 84 18:54:12 PDT
Date: 29 Sep 84 1854 PDT
From: Lowell Wood <LLW@S1-A.ARPA>
Subject: FY'85 Consulting Contracts
To: GAP@S1-A.ARPA
CC: LLW@S1-A.ARPA, jmc@SU-AI.ARPA
∂28-Sep-84 2137 JMC@SU-AI.ARPA
Received: from SU-AI.ARPA by S1-A.ARPA with TCP; 28 Sep 84 21:37:00 PDT
Date: 28 Sep 84 2135 PDT
From: John McCarthy <JMC@SU-AI.ARPA>
To: llw@S1-A.ARPA
A new consulting contract has not arrived.
[Gloria, please check into what has happened here. Also, inquire as
to what's happening on all other consulting contracts. Thanks, Lowell]
∂29-Sep-84 1909 RESTIVO@SU-SCORE.ARPA
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Sep 84 19:09:22 PDT
Date: Sat 29 Sep 84 19:06:31-PDT
From: Chuck Restivo <RESTIVO@SU-SCORE.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Message from "John McCarthy <JMC@SU-AI.ARPA>" of Mon 17 Sep 84 10:53:00-PDT
[cwr] is sometime this week OK to talk about this applications paper?
-------
∂29-Sep-84 2158 G.RYLAND@SU-SCORE.ARPA bboard comments
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 29 Sep 84 21:57:53 PDT
Date: Sat 29 Sep 84 21:55:04-PDT
From: Chris Ryland <g.Ryland@SU-SCORE.ARPA>
Subject: bboard comments
To: jmc@SU-AI.ARPA
John:
I find it constantly amazing that I agree with nearly every one of your
comments on the BBoards. I must be a 30 year old curmudgeon, or something!
Keep it up.
--Chris Ryland, IMAGEN
-------
∂30-Sep-84 1120 KING@KESTREL.ARPA
Received: from KESTREL.ARPA by SU-AI.ARPA with TCP; 30 Sep 84 11:20:23 PDT
Date: 30 Sep 1984 1049-PDT
From: Richard M. King <KING@KESTREL.ARPA>
To: JMC@SU-AI.ARPA
In-Reply-To: Your message of 29-Sep-84 2159-PDT
Thanks for the info...
Dick
-------
∂30-Sep-84 1936 GOLUB@SU-SCORE.ARPA IMPORTANT
Received: from SU-SCORE.ARPA by SU-AI.ARPA with TCP; 30 Sep 84 19:35:57 PDT
Date: Sun 30 Sep 84 19:32:40-PDT
From: Gene Golub <GOLUB@SU-SCORE.ARPA>
Subject: IMPORTANT
To: Full-Professors: ;
Immediately after the Senior Faculty Meeting, there will be a discussion
of the promotion of Terry Winograd to Full Professor. Iexpect the first meeting
to last about 3/4 of an hour so that this meeting will begin at 3:30 and
should end by 4.
- GENE
-------
∂30-Sep-84 2128 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley panel discussion
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 30 Sep 84 21:28:11 PDT
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA07953; Sun, 30 Sep 84 21:29:47 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA00890; Sun, 30 Sep 84 17:43:01 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA00607; Sun, 30 Sep 84 10:07:39 pdt
Date: Sun, 30 Sep 84 10:07:39 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8409301707.AA00607@ucscg.UCSC>
To: jmc@su-ai
Subject: panel discussion
The three speakers will each begin with a ten-minute presentation.
Do you have a preference about the order? If so you may have your
choice. If not, the order will be Ornstein, you, Winograd.
∂30-Sep-84 2129 ucscc!beeson%ucscg.ucscc.UUCP@Berkeley directions to panel discussion
Received: from UCB-VAX.ARPA by SU-AI.ARPA with TCP; 30 Sep 84 21:28:54 PDT
Received: by UCB-VAX.ARPA (4.24/4.31)
id AA07984; Sun, 30 Sep 84 21:30:26 pdt
Received: from ucscg.UCSC (ucscg.ARPA) by ucscc.UCSC (4.12/4.7)
id AA00911; Sun, 30 Sep 84 17:43:24 pdt
Received: by ucscg.UCSC (4.12/4.7)
id AA00569; Sun, 30 Sep 84 09:55:57 pdt
Date: Sun, 30 Sep 84 09:55:57 pdt
From: ucscc!beeson%ucscg.ucscc.UUCP@Berkeley (20012000)
Message-Id: <8409301655.AA00569@ucscg.UCSC>
To: jmc@su-ai
Subject: directions to panel discussion
Take 280 south to the 7th street exit, which is past
downtown San Jose. Exit and take two left turns, which
will take you under the freeway headed north on 7th street.
After several blocks 7th street deadends at San Carlos.
Half a block before that happens there is a parking garage
on your left. Park there as follows: When entering the
garage you take the far right of 3 available entry lanes;
that is the employees' lane and you will not have to pay.
If there is no obvious attendant just drive in. If there
is an attendant visible you may tell him/her that you are
an invited speaker, and they should let you in. (Very likely
you could just drive in without bothering with this step.)
You can park anywhere except in a handicapped space.
The panel discussion will take place in Duncan Hall 135.
Duncan Hall is west of the parking garage. (You entered
on the east). Duncan Hall 135 is entered from the south
side of Duncan Hall; if you enter through the main entrance
you will just have to go out again on the other side after
a brief period of confusion about not finding 135.
Considering the traffic situation on 280 at that time of
day, you might wish to come early. In that case go to
MacQuarrie Hall, which is immediately north of the parking
garage at its west end. Go to the math office on the second
floor and the secretary will show you to a pleasant, quiet
room lined with a beautiful collection of mathematical books
where you can pass the time.
∂30-Sep-84 2359 JMC*
New quarter